./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/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 87f4b9a5847fc100ee315fb7d7bd5061116ea6e9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:30:55,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:30:55,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:30:55,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:30:55,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:30:55,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:30:55,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:30:55,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:30:55,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:30:55,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:30:55,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:30:55,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:30:55,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:30:55,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:30:55,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:30:55,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:30:55,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:30:55,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:30:55,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:30:55,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:30:55,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:30:55,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:30:55,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:30:55,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:30:55,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:30:55,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:30:55,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:30:55,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:30:55,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:30:55,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:30:55,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:30:55,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:30:55,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:30:55,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:30:55,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:30:55,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:30:55,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:30:55,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:30:55,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:30:55,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:30:55,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:30:55,327 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:30:55,353 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:30:55,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:30:55,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:30:55,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:30:55,365 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:30:55,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:30:55,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:30:55,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:30:55,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:30:55,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:30:55,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:30:55,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:30:55,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:30:55,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:30:55,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:30:55,369 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:30:55,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:30:55,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:30:55,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:30:55,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:30:55,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:30:55,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:30:55,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:30:55,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:30:55,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:30:55,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:30:55,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:30:55,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:30:55,373 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_1245ab2b-055c-46e0-b70e-c306da75880b/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 -> 87f4b9a5847fc100ee315fb7d7bd5061116ea6e9 [2019-11-15 22:30:55,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:30:55,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:30:55,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:30:55,412 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:30:55,412 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:30:55,413 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2019-11-15 22:30:55,460 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/data/cb43ee5b9/95c9e1e74683428990cff97b1147a8d8/FLAG295da8b28 [2019-11-15 22:30:55,974 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:30:55,975 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2019-11-15 22:30:55,991 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/data/cb43ee5b9/95c9e1e74683428990cff97b1147a8d8/FLAG295da8b28 [2019-11-15 22:30:56,260 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/data/cb43ee5b9/95c9e1e74683428990cff97b1147a8d8 [2019-11-15 22:30:56,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:30:56,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:30:56,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:30:56,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:30:56,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:30:56,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72956611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56, skipping insertion in model container [2019-11-15 22:30:56,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,281 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:30:56,316 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:30:56,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:30:56,638 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:30:56,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:30:56,725 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:30:56,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56 WrapperNode [2019-11-15 22:30:56,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:30:56,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:30:56,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:30:56,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:30:56,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:30:56,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:30:56,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:30:56,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:30:56,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... [2019-11-15 22:30:56,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:30:56,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:30:56,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:30:56,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:30:56,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/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-15 22:30:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:30:56,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:30:57,133 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:30:57,699 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 22:30:57,699 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 22:30:57,700 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:30:57,701 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:30:57,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:30:57 BoogieIcfgContainer [2019-11-15 22:30:57,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:30:57,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:30:57,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:30:57,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:30:57,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:30:56" (1/3) ... [2019-11-15 22:30:57,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55483a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:30:57, skipping insertion in model container [2019-11-15 22:30:57,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:56" (2/3) ... [2019-11-15 22:30:57,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55483a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:30:57, skipping insertion in model container [2019-11-15 22:30:57,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:30:57" (3/3) ... [2019-11-15 22:30:57,710 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a.BV.c.cil.c [2019-11-15 22:30:57,720 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:30:57,727 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:30:57,737 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:30:57,761 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:30:57,765 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:30:57,766 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:30:57,766 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:30:57,766 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:30:57,766 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:30:57,766 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:30:57,766 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:30:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-15 22:30:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:30:57,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:57,803 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:57,805 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash -91609757, now seen corresponding path program 1 times [2019-11-15 22:30:57,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:57,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304282073] [2019-11-15 22:30:57,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:57,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:57,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:58,031 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-15 22:30:58,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304282073] [2019-11-15 22:30:58,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:58,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:30:58,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638365637] [2019-11-15 22:30:58,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:30:58,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:58,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:30:58,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:58,056 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-15 22:30:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:58,470 INFO L93 Difference]: Finished difference Result 316 states and 546 transitions. [2019-11-15 22:30:58,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:30:58,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 22:30:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:58,492 INFO L225 Difference]: With dead ends: 316 [2019-11-15 22:30:58,492 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 22:30:58,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 22:30:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2019-11-15 22:30:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 22:30:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2019-11-15 22:30:58,591 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 43 [2019-11-15 22:30:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:58,592 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2019-11-15 22:30:58,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:30:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2019-11-15 22:30:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:30:58,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:58,598 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:58,599 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:58,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:58,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1448029290, now seen corresponding path program 1 times [2019-11-15 22:30:58,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:58,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576815984] [2019-11-15 22:30:58,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:58,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:58,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:58,703 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-15 22:30:58,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576815984] [2019-11-15 22:30:58,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:58,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:30:58,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328837093] [2019-11-15 22:30:58,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:30:58,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:58,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:30:58,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:58,707 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand 3 states. [2019-11-15 22:30:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:58,939 INFO L93 Difference]: Finished difference Result 351 states and 564 transitions. [2019-11-15 22:30:58,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:30:58,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 22:30:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:58,942 INFO L225 Difference]: With dead ends: 351 [2019-11-15 22:30:58,943 INFO L226 Difference]: Without dead ends: 201 [2019-11-15 22:30:58,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-15 22:30:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2019-11-15 22:30:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-15 22:30:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 319 transitions. [2019-11-15 22:30:58,962 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 319 transitions. Word has length 44 [2019-11-15 22:30:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:58,963 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 319 transitions. [2019-11-15 22:30:58,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:30:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 319 transitions. [2019-11-15 22:30:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:30:58,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:58,968 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:58,968 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2008911458, now seen corresponding path program 1 times [2019-11-15 22:30:58,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:58,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533994822] [2019-11-15 22:30:58,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:58,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:58,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:59,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533994822] [2019-11-15 22:30:59,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:59,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:30:59,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620204187] [2019-11-15 22:30:59,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:30:59,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:59,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:30:59,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:59,099 INFO L87 Difference]: Start difference. First operand 196 states and 319 transitions. Second operand 3 states. [2019-11-15 22:30:59,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:59,148 INFO L93 Difference]: Finished difference Result 572 states and 934 transitions. [2019-11-15 22:30:59,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:30:59,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-15 22:30:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:59,153 INFO L225 Difference]: With dead ends: 572 [2019-11-15 22:30:59,153 INFO L226 Difference]: Without dead ends: 383 [2019-11-15 22:30:59,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-15 22:30:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2019-11-15 22:30:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-15 22:30:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 623 transitions. [2019-11-15 22:30:59,200 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 623 transitions. Word has length 59 [2019-11-15 22:30:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:59,203 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 623 transitions. [2019-11-15 22:30:59,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:30:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 623 transitions. [2019-11-15 22:30:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 22:30:59,210 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:59,210 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:59,210 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash 44999767, now seen corresponding path program 1 times [2019-11-15 22:30:59,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:59,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144775620] [2019-11-15 22:30:59,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:59,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:59,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 22:30:59,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144775620] [2019-11-15 22:30:59,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:59,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:30:59,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819453626] [2019-11-15 22:30:59,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:30:59,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:59,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:30:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:59,312 INFO L87 Difference]: Start difference. First operand 383 states and 623 transitions. Second operand 3 states. [2019-11-15 22:30:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:59,491 INFO L93 Difference]: Finished difference Result 811 states and 1316 transitions. [2019-11-15 22:30:59,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:30:59,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-15 22:30:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:59,496 INFO L225 Difference]: With dead ends: 811 [2019-11-15 22:30:59,496 INFO L226 Difference]: Without dead ends: 435 [2019-11-15 22:30:59,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-15 22:30:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-11-15 22:30:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-15 22:30:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 685 transitions. [2019-11-15 22:30:59,520 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 685 transitions. Word has length 80 [2019-11-15 22:30:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:59,521 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 685 transitions. [2019-11-15 22:30:59,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:30:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 685 transitions. [2019-11-15 22:30:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 22:30:59,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:59,524 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:59,524 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:59,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:59,525 INFO L82 PathProgramCache]: Analyzing trace with hash 586802411, now seen corresponding path program 1 times [2019-11-15 22:30:59,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:59,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406358487] [2019-11-15 22:30:59,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:59,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:59,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 22:30:59,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406358487] [2019-11-15 22:30:59,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:59,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:30:59,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9173327] [2019-11-15 22:30:59,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:30:59,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:30:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:59,581 INFO L87 Difference]: Start difference. First operand 425 states and 685 transitions. Second operand 3 states. [2019-11-15 22:30:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:59,785 INFO L93 Difference]: Finished difference Result 853 states and 1374 transitions. [2019-11-15 22:30:59,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:30:59,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-15 22:30:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:59,790 INFO L225 Difference]: With dead ends: 853 [2019-11-15 22:30:59,790 INFO L226 Difference]: Without dead ends: 435 [2019-11-15 22:30:59,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-15 22:30:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-11-15 22:30:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-15 22:30:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 681 transitions. [2019-11-15 22:30:59,815 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 681 transitions. Word has length 81 [2019-11-15 22:30:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:59,815 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 681 transitions. [2019-11-15 22:30:59,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:30:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 681 transitions. [2019-11-15 22:30:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:30:59,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:59,818 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:59,818 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:59,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1514553016, now seen corresponding path program 1 times [2019-11-15 22:30:59,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:59,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932556130] [2019-11-15 22:30:59,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:59,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:59,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:30:59,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932556130] [2019-11-15 22:30:59,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:59,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:30:59,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119767942] [2019-11-15 22:30:59,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:30:59,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:59,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:30:59,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:59,927 INFO L87 Difference]: Start difference. First operand 425 states and 681 transitions. Second operand 3 states. [2019-11-15 22:31:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:00,151 INFO L93 Difference]: Finished difference Result 971 states and 1575 transitions. [2019-11-15 22:31:00,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:00,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 22:31:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:00,155 INFO L225 Difference]: With dead ends: 971 [2019-11-15 22:31:00,156 INFO L226 Difference]: Without dead ends: 553 [2019-11-15 22:31:00,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-15 22:31:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 543. [2019-11-15 22:31:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-11-15 22:31:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 797 transitions. [2019-11-15 22:31:00,177 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 797 transitions. Word has length 96 [2019-11-15 22:31:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:00,177 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 797 transitions. [2019-11-15 22:31:00,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 797 transitions. [2019-11-15 22:31:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:31:00,180 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:00,180 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:00,180 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:00,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1948282102, now seen corresponding path program 1 times [2019-11-15 22:31:00,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:00,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644624371] [2019-11-15 22:31:00,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:00,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:00,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:31:00,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644624371] [2019-11-15 22:31:00,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:00,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:00,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4607793] [2019-11-15 22:31:00,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:00,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:00,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:00,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:00,236 INFO L87 Difference]: Start difference. First operand 543 states and 797 transitions. Second operand 3 states. [2019-11-15 22:31:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:00,433 INFO L93 Difference]: Finished difference Result 1167 states and 1733 transitions. [2019-11-15 22:31:00,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:00,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 22:31:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:00,438 INFO L225 Difference]: With dead ends: 1167 [2019-11-15 22:31:00,438 INFO L226 Difference]: Without dead ends: 631 [2019-11-15 22:31:00,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-15 22:31:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 605. [2019-11-15 22:31:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-11-15 22:31:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 885 transitions. [2019-11-15 22:31:00,462 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 885 transitions. Word has length 96 [2019-11-15 22:31:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:00,463 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 885 transitions. [2019-11-15 22:31:00,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 885 transitions. [2019-11-15 22:31:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 22:31:00,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:00,466 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:00,467 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash 564782516, now seen corresponding path program 1 times [2019-11-15 22:31:00,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:00,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430732106] [2019-11-15 22:31:00,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:00,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:00,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:00,554 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-15 22:31:00,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430732106] [2019-11-15 22:31:00,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:00,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:00,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934574321] [2019-11-15 22:31:00,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:00,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:00,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:00,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:00,557 INFO L87 Difference]: Start difference. First operand 605 states and 885 transitions. Second operand 3 states. [2019-11-15 22:31:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:00,600 INFO L93 Difference]: Finished difference Result 905 states and 1324 transitions. [2019-11-15 22:31:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:00,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-15 22:31:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:00,607 INFO L225 Difference]: With dead ends: 905 [2019-11-15 22:31:00,608 INFO L226 Difference]: Without dead ends: 903 [2019-11-15 22:31:00,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-15 22:31:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-11-15 22:31:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-11-15 22:31:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1322 transitions. [2019-11-15 22:31:00,636 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1322 transitions. Word has length 120 [2019-11-15 22:31:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:00,637 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1322 transitions. [2019-11-15 22:31:00,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1322 transitions. [2019-11-15 22:31:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 22:31:00,641 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:00,641 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 22:31:00,642 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1174075643, now seen corresponding path program 1 times [2019-11-15 22:31:00,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:00,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505973045] [2019-11-15 22:31:00,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:00,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:00,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-15 22:31:00,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505973045] [2019-11-15 22:31:00,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:00,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:00,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804941328] [2019-11-15 22:31:00,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:00,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:00,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:00,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:00,721 INFO L87 Difference]: Start difference. First operand 903 states and 1322 transitions. Second operand 3 states. [2019-11-15 22:31:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:00,867 INFO L93 Difference]: Finished difference Result 1877 states and 2732 transitions. [2019-11-15 22:31:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:00,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-15 22:31:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:00,874 INFO L225 Difference]: With dead ends: 1877 [2019-11-15 22:31:00,874 INFO L226 Difference]: Without dead ends: 981 [2019-11-15 22:31:00,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-11-15 22:31:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 972. [2019-11-15 22:31:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-15 22:31:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1406 transitions. [2019-11-15 22:31:00,907 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1406 transitions. Word has length 184 [2019-11-15 22:31:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:00,907 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1406 transitions. [2019-11-15 22:31:00,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1406 transitions. [2019-11-15 22:31:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 22:31:00,929 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:00,929 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:31:00,930 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:00,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:00,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1179429289, now seen corresponding path program 1 times [2019-11-15 22:31:00,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:00,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065452544] [2019-11-15 22:31:00,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:00,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:00,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-15 22:31:01,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065452544] [2019-11-15 22:31:01,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:01,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:01,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692595268] [2019-11-15 22:31:01,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:01,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:01,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:01,005 INFO L87 Difference]: Start difference. First operand 972 states and 1406 transitions. Second operand 3 states. [2019-11-15 22:31:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:01,149 INFO L93 Difference]: Finished difference Result 2048 states and 2960 transitions. [2019-11-15 22:31:01,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:01,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-15 22:31:01,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:01,156 INFO L225 Difference]: With dead ends: 2048 [2019-11-15 22:31:01,156 INFO L226 Difference]: Without dead ends: 1083 [2019-11-15 22:31:01,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-15 22:31:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1047. [2019-11-15 22:31:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-11-15 22:31:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1496 transitions. [2019-11-15 22:31:01,192 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1496 transitions. Word has length 204 [2019-11-15 22:31:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:01,193 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 1496 transitions. [2019-11-15 22:31:01,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1496 transitions. [2019-11-15 22:31:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 22:31:01,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:01,197 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 22:31:01,197 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:01,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:01,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1179962115, now seen corresponding path program 1 times [2019-11-15 22:31:01,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:01,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829638072] [2019-11-15 22:31:01,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:01,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:01,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-11-15 22:31:01,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829638072] [2019-11-15 22:31:01,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:01,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:01,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029431786] [2019-11-15 22:31:01,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:01,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:01,274 INFO L87 Difference]: Start difference. First operand 1047 states and 1496 transitions. Second operand 3 states. [2019-11-15 22:31:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:01,319 INFO L93 Difference]: Finished difference Result 3109 states and 4430 transitions. [2019-11-15 22:31:01,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:01,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-15 22:31:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:01,331 INFO L225 Difference]: With dead ends: 3109 [2019-11-15 22:31:01,332 INFO L226 Difference]: Without dead ends: 2069 [2019-11-15 22:31:01,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-11-15 22:31:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1050. [2019-11-15 22:31:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-11-15 22:31:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1499 transitions. [2019-11-15 22:31:01,378 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1499 transitions. Word has length 230 [2019-11-15 22:31:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:01,378 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 1499 transitions. [2019-11-15 22:31:01,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1499 transitions. [2019-11-15 22:31:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 22:31:01,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:01,383 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 22:31:01,383 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:01,384 INFO L82 PathProgramCache]: Analyzing trace with hash -150020643, now seen corresponding path program 1 times [2019-11-15 22:31:01,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:01,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055463416] [2019-11-15 22:31:01,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:01,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:01,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-11-15 22:31:01,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055463416] [2019-11-15 22:31:01,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:01,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:01,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388435889] [2019-11-15 22:31:01,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:01,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:01,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:01,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:01,475 INFO L87 Difference]: Start difference. First operand 1050 states and 1499 transitions. Second operand 3 states. [2019-11-15 22:31:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:01,639 INFO L93 Difference]: Finished difference Result 2195 states and 3134 transitions. [2019-11-15 22:31:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:01,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-15 22:31:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:01,647 INFO L225 Difference]: With dead ends: 2195 [2019-11-15 22:31:01,647 INFO L226 Difference]: Without dead ends: 1152 [2019-11-15 22:31:01,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-11-15 22:31:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1131. [2019-11-15 22:31:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-11-15 22:31:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1595 transitions. [2019-11-15 22:31:01,694 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1595 transitions. Word has length 230 [2019-11-15 22:31:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:01,694 INFO L462 AbstractCegarLoop]: Abstraction has 1131 states and 1595 transitions. [2019-11-15 22:31:01,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1595 transitions. [2019-11-15 22:31:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-15 22:31:01,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:01,700 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:01,701 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash -336843366, now seen corresponding path program 1 times [2019-11-15 22:31:01,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:01,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612704490] [2019-11-15 22:31:01,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:01,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:01,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-11-15 22:31:01,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612704490] [2019-11-15 22:31:01,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:01,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:01,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005669503] [2019-11-15 22:31:01,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:01,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:01,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:01,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:01,869 INFO L87 Difference]: Start difference. First operand 1131 states and 1595 transitions. Second operand 3 states. [2019-11-15 22:31:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:01,936 INFO L93 Difference]: Finished difference Result 3373 states and 4754 transitions. [2019-11-15 22:31:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:01,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-15 22:31:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:01,950 INFO L225 Difference]: With dead ends: 3373 [2019-11-15 22:31:01,951 INFO L226 Difference]: Without dead ends: 2249 [2019-11-15 22:31:01,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-15 22:31:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2247. [2019-11-15 22:31:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2019-11-15 22:31:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3163 transitions. [2019-11-15 22:31:02,029 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3163 transitions. Word has length 231 [2019-11-15 22:31:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:02,029 INFO L462 AbstractCegarLoop]: Abstraction has 2247 states and 3163 transitions. [2019-11-15 22:31:02,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3163 transitions. [2019-11-15 22:31:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 22:31:02,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:02,036 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:02,036 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1934345498, now seen corresponding path program 1 times [2019-11-15 22:31:02,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:02,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543839164] [2019-11-15 22:31:02,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:02,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:02,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-15 22:31:02,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543839164] [2019-11-15 22:31:02,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:02,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:02,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93534519] [2019-11-15 22:31:02,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:02,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:02,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:02,126 INFO L87 Difference]: Start difference. First operand 2247 states and 3163 transitions. Second operand 3 states. [2019-11-15 22:31:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:02,373 INFO L93 Difference]: Finished difference Result 4733 states and 6735 transitions. [2019-11-15 22:31:02,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:02,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-15 22:31:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:02,388 INFO L225 Difference]: With dead ends: 4733 [2019-11-15 22:31:02,389 INFO L226 Difference]: Without dead ends: 2433 [2019-11-15 22:31:02,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2019-11-15 22:31:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2019-11-15 22:31:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-11-15 22:31:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3379 transitions. [2019-11-15 22:31:02,475 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3379 transitions. Word has length 232 [2019-11-15 22:31:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:02,476 INFO L462 AbstractCegarLoop]: Abstraction has 2433 states and 3379 transitions. [2019-11-15 22:31:02,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3379 transitions. [2019-11-15 22:31:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-15 22:31:02,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:02,484 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:02,484 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:02,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:02,484 INFO L82 PathProgramCache]: Analyzing trace with hash -462203708, now seen corresponding path program 1 times [2019-11-15 22:31:02,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:02,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435076642] [2019-11-15 22:31:02,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:02,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:02,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-15 22:31:02,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435076642] [2019-11-15 22:31:02,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037212626] [2019-11-15 22:31:02,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/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-15 22:31:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:02,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:31:02,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-15 22:31:02,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:31:02,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:31:02,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35280403] [2019-11-15 22:31:02,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:02,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:02,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:02,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:31:02,869 INFO L87 Difference]: Start difference. First operand 2433 states and 3379 transitions. Second operand 3 states. [2019-11-15 22:31:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:02,976 INFO L93 Difference]: Finished difference Result 5667 states and 7870 transitions. [2019-11-15 22:31:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:02,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-15 22:31:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:02,997 INFO L225 Difference]: With dead ends: 5667 [2019-11-15 22:31:02,997 INFO L226 Difference]: Without dead ends: 3241 [2019-11-15 22:31:03,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 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-15 22:31:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2019-11-15 22:31:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3241. [2019-11-15 22:31:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2019-11-15 22:31:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4500 transitions. [2019-11-15 22:31:03,136 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4500 transitions. Word has length 244 [2019-11-15 22:31:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:03,137 INFO L462 AbstractCegarLoop]: Abstraction has 3241 states and 4500 transitions. [2019-11-15 22:31:03,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4500 transitions. [2019-11-15 22:31:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 22:31:03,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:03,145 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:03,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:03,351 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:03,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:03,351 INFO L82 PathProgramCache]: Analyzing trace with hash 464017511, now seen corresponding path program 1 times [2019-11-15 22:31:03,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:03,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735440352] [2019-11-15 22:31:03,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:03,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:03,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:31:03,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735440352] [2019-11-15 22:31:03,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391965253] [2019-11-15 22:31:03,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/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-15 22:31:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:03,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:31:03,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:31:03,686 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:31:03,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:31:03,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217808268] [2019-11-15 22:31:03,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:31:03,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:31:03,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:31:03,688 INFO L87 Difference]: Start difference. First operand 3241 states and 4500 transitions. Second operand 4 states. [2019-11-15 22:31:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:04,155 INFO L93 Difference]: Finished difference Result 8229 states and 11374 transitions. [2019-11-15 22:31:04,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:31:04,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-15 22:31:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:04,183 INFO L225 Difference]: With dead ends: 8229 [2019-11-15 22:31:04,184 INFO L226 Difference]: Without dead ends: 4995 [2019-11-15 22:31:04,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:31:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2019-11-15 22:31:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4161. [2019-11-15 22:31:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4161 states. [2019-11-15 22:31:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 5572 transitions. [2019-11-15 22:31:04,348 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 5572 transitions. Word has length 252 [2019-11-15 22:31:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:04,348 INFO L462 AbstractCegarLoop]: Abstraction has 4161 states and 5572 transitions. [2019-11-15 22:31:04,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:31:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 5572 transitions. [2019-11-15 22:31:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 22:31:04,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:04,360 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:04,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:04,564 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:04,565 INFO L82 PathProgramCache]: Analyzing trace with hash 752836901, now seen corresponding path program 1 times [2019-11-15 22:31:04,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:04,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168893564] [2019-11-15 22:31:04,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:04,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:04,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 22:31:04,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168893564] [2019-11-15 22:31:04,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:04,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:04,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329274196] [2019-11-15 22:31:04,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:04,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:04,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:04,683 INFO L87 Difference]: Start difference. First operand 4161 states and 5572 transitions. Second operand 3 states. [2019-11-15 22:31:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:04,868 INFO L93 Difference]: Finished difference Result 11621 states and 15694 transitions. [2019-11-15 22:31:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:04,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-15 22:31:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:04,912 INFO L225 Difference]: With dead ends: 11621 [2019-11-15 22:31:04,913 INFO L226 Difference]: Without dead ends: 5141 [2019-11-15 22:31:04,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2019-11-15 22:31:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 4886. [2019-11-15 22:31:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2019-11-15 22:31:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 6668 transitions. [2019-11-15 22:31:05,102 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 6668 transitions. Word has length 252 [2019-11-15 22:31:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:05,102 INFO L462 AbstractCegarLoop]: Abstraction has 4886 states and 6668 transitions. [2019-11-15 22:31:05,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 6668 transitions. [2019-11-15 22:31:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-15 22:31:05,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:05,114 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:31:05,114 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1551518133, now seen corresponding path program 1 times [2019-11-15 22:31:05,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:05,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321726659] [2019-11-15 22:31:05,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:05,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:05,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2019-11-15 22:31:05,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321726659] [2019-11-15 22:31:05,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:05,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:05,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113826043] [2019-11-15 22:31:05,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:05,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:05,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:05,301 INFO L87 Difference]: Start difference. First operand 4886 states and 6668 transitions. Second operand 3 states. [2019-11-15 22:31:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:05,582 INFO L93 Difference]: Finished difference Result 10137 states and 13841 transitions. [2019-11-15 22:31:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:05,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-15 22:31:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:05,593 INFO L225 Difference]: With dead ends: 10137 [2019-11-15 22:31:05,593 INFO L226 Difference]: Without dead ends: 5258 [2019-11-15 22:31:05,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-11-15 22:31:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5234. [2019-11-15 22:31:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2019-11-15 22:31:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7076 transitions. [2019-11-15 22:31:05,770 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7076 transitions. Word has length 321 [2019-11-15 22:31:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:05,771 INFO L462 AbstractCegarLoop]: Abstraction has 5234 states and 7076 transitions. [2019-11-15 22:31:05,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7076 transitions. [2019-11-15 22:31:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-11-15 22:31:05,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:05,784 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:31:05,784 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:05,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:05,785 INFO L82 PathProgramCache]: Analyzing trace with hash -16053374, now seen corresponding path program 1 times [2019-11-15 22:31:05,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:05,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253539417] [2019-11-15 22:31:05,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:05,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:05,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-15 22:31:05,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253539417] [2019-11-15 22:31:05,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330068657] [2019-11-15 22:31:05,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/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-15 22:31:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:06,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:31:06,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2019-11-15 22:31:06,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:31:06,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:31:06,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143372801] [2019-11-15 22:31:06,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:06,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:06,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:31:06,245 INFO L87 Difference]: Start difference. First operand 5234 states and 7076 transitions. Second operand 3 states. [2019-11-15 22:31:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:06,371 INFO L93 Difference]: Finished difference Result 6046 states and 8192 transitions. [2019-11-15 22:31:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:06,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2019-11-15 22:31:06,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:06,383 INFO L225 Difference]: With dead ends: 6046 [2019-11-15 22:31:06,383 INFO L226 Difference]: Without dead ends: 4563 [2019-11-15 22:31:06,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 354 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-15 22:31:06,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2019-11-15 22:31:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 3753. [2019-11-15 22:31:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2019-11-15 22:31:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 5068 transitions. [2019-11-15 22:31:06,565 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 5068 transitions. Word has length 354 [2019-11-15 22:31:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:06,566 INFO L462 AbstractCegarLoop]: Abstraction has 3753 states and 5068 transitions. [2019-11-15 22:31:06,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 5068 transitions. [2019-11-15 22:31:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-11-15 22:31:06,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:06,583 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:06,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:06,799 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:06,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:06,800 INFO L82 PathProgramCache]: Analyzing trace with hash -235980636, now seen corresponding path program 1 times [2019-11-15 22:31:06,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:06,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813001211] [2019-11-15 22:31:06,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:06,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:06,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2019-11-15 22:31:07,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813001211] [2019-11-15 22:31:07,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509270104] [2019-11-15 22:31:07,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:07,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:31:07,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2019-11-15 22:31:07,361 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:31:07,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:31:07,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253280583] [2019-11-15 22:31:07,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:31:07,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:07,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:31:07,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:31:07,366 INFO L87 Difference]: Start difference. First operand 3753 states and 5068 transitions. Second operand 4 states. [2019-11-15 22:31:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:07,861 INFO L93 Difference]: Finished difference Result 8431 states and 11397 transitions. [2019-11-15 22:31:07,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:31:07,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 416 [2019-11-15 22:31:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:07,871 INFO L225 Difference]: With dead ends: 8431 [2019-11-15 22:31:07,871 INFO L226 Difference]: Without dead ends: 4516 [2019-11-15 22:31:07,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 418 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-15 22:31:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2019-11-15 22:31:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 3782. [2019-11-15 22:31:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-11-15 22:31:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5040 transitions. [2019-11-15 22:31:08,019 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5040 transitions. Word has length 416 [2019-11-15 22:31:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:08,020 INFO L462 AbstractCegarLoop]: Abstraction has 3782 states and 5040 transitions. [2019-11-15 22:31:08,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:31:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5040 transitions. [2019-11-15 22:31:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-11-15 22:31:08,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:08,036 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:31:08,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:08,241 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:08,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1952122078, now seen corresponding path program 1 times [2019-11-15 22:31:08,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:08,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425093333] [2019-11-15 22:31:08,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:08,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:08,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 1354 proven. 13 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2019-11-15 22:31:08,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425093333] [2019-11-15 22:31:08,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852883314] [2019-11-15 22:31:08,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:08,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:31:08,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 1354 proven. 13 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2019-11-15 22:31:08,792 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:31:08,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:31:08,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848268200] [2019-11-15 22:31:08,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:31:08,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:31:08,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:31:08,795 INFO L87 Difference]: Start difference. First operand 3782 states and 5040 transitions. Second operand 4 states. [2019-11-15 22:31:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:09,351 INFO L93 Difference]: Finished difference Result 11074 states and 14738 transitions. [2019-11-15 22:31:09,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:31:09,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 448 [2019-11-15 22:31:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:09,366 INFO L225 Difference]: With dead ends: 11074 [2019-11-15 22:31:09,367 INFO L226 Difference]: Without dead ends: 7488 [2019-11-15 22:31:09,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 450 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-15 22:31:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7488 states. [2019-11-15 22:31:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7488 to 5198. [2019-11-15 22:31:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5198 states. [2019-11-15 22:31:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 6920 transitions. [2019-11-15 22:31:09,615 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 6920 transitions. Word has length 448 [2019-11-15 22:31:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:09,616 INFO L462 AbstractCegarLoop]: Abstraction has 5198 states and 6920 transitions. [2019-11-15 22:31:09,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:31:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 6920 transitions. [2019-11-15 22:31:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-15 22:31:09,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:09,638 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 22:31:09,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:09,842 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash -671064672, now seen corresponding path program 1 times [2019-11-15 22:31:09,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:09,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930165210] [2019-11-15 22:31:09,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:09,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:09,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2900 backedges. 1662 proven. 0 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2019-11-15 22:31:10,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930165210] [2019-11-15 22:31:10,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:10,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:10,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342861049] [2019-11-15 22:31:10,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:10,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:10,131 INFO L87 Difference]: Start difference. First operand 5198 states and 6920 transitions. Second operand 3 states. [2019-11-15 22:31:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:10,360 INFO L93 Difference]: Finished difference Result 11001 states and 14577 transitions. [2019-11-15 22:31:10,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:10,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-15 22:31:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:10,372 INFO L225 Difference]: With dead ends: 11001 [2019-11-15 22:31:10,372 INFO L226 Difference]: Without dead ends: 5810 [2019-11-15 22:31:10,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2019-11-15 22:31:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 5776. [2019-11-15 22:31:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5776 states. [2019-11-15 22:31:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 7583 transitions. [2019-11-15 22:31:10,538 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 7583 transitions. Word has length 493 [2019-11-15 22:31:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:10,539 INFO L462 AbstractCegarLoop]: Abstraction has 5776 states and 7583 transitions. [2019-11-15 22:31:10,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 7583 transitions. [2019-11-15 22:31:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-11-15 22:31:10,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:10,560 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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] [2019-11-15 22:31:10,561 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:10,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1196437202, now seen corresponding path program 1 times [2019-11-15 22:31:10,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:10,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764113392] [2019-11-15 22:31:10,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:10,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:10,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1660 proven. 77 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2019-11-15 22:31:10,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764113392] [2019-11-15 22:31:10,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051800236] [2019-11-15 22:31:10,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:10,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:31:10,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-11-15 22:31:11,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:31:11,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:31:11,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564279690] [2019-11-15 22:31:11,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:11,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:31:11,182 INFO L87 Difference]: Start difference. First operand 5776 states and 7583 transitions. Second operand 3 states. [2019-11-15 22:31:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:11,479 INFO L93 Difference]: Finished difference Result 11733 states and 15463 transitions. [2019-11-15 22:31:11,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:11,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-11-15 22:31:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:11,491 INFO L225 Difference]: With dead ends: 11733 [2019-11-15 22:31:11,491 INFO L226 Difference]: Without dead ends: 5964 [2019-11-15 22:31:11,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:31:11,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-11-15 22:31:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5864. [2019-11-15 22:31:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5864 states. [2019-11-15 22:31:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 7707 transitions. [2019-11-15 22:31:11,684 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 7707 transitions. Word has length 508 [2019-11-15 22:31:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:11,685 INFO L462 AbstractCegarLoop]: Abstraction has 5864 states and 7707 transitions. [2019-11-15 22:31:11,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 7707 transitions. [2019-11-15 22:31:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-11-15 22:31:11,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:11,707 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:11,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:11,921 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:11,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:11,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1496383928, now seen corresponding path program 1 times [2019-11-15 22:31:11,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:11,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374955694] [2019-11-15 22:31:11,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:11,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:11,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1744 proven. 206 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2019-11-15 22:31:12,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374955694] [2019-11-15 22:31:12,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989031595] [2019-11-15 22:31:12,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:13,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:31:13,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:13,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:31:13,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:31:13,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:31:13,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:31:14,407 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse0 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= c_ULTIMATE.start_ssl3_accept_~s__state~0 .cse0) (<= .cse0 2147483647) (< 2147483647 .cse0)))) (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse1 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= c_ULTIMATE.start_ssl3_accept_~s__state~0 .cse1) (<= .cse1 2147483647) (<= .cse1 8496)))) (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse2 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= (+ c_ULTIMATE.start_ssl3_accept_~s__state~0 4294967296) .cse2) (< 2147483647 .cse2)))) (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= (+ c_ULTIMATE.start_ssl3_accept_~s__state~0 4294967296) .cse3) (< 2147483647 .cse3) (<= .cse3 8496))))) is different from true [2019-11-15 22:31:16,775 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 50 DAG size of output: 16 [2019-11-15 22:31:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 232 refuted. 0 times theorem prover too weak. 1173 trivial. 7 not checked. [2019-11-15 22:31:17,554 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:31:17,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-11-15 22:31:17,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786063259] [2019-11-15 22:31:17,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:31:17,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:17,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:31:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2019-11-15 22:31:17,559 INFO L87 Difference]: Start difference. First operand 5864 states and 7707 transitions. Second operand 9 states. [2019-11-15 22:31:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:32,040 INFO L93 Difference]: Finished difference Result 24395 states and 31719 transitions. [2019-11-15 22:31:32,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:31:32,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 512 [2019-11-15 22:31:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:32,070 INFO L225 Difference]: With dead ends: 24395 [2019-11-15 22:31:32,070 INFO L226 Difference]: Without dead ends: 17838 [2019-11-15 22:31:32,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 515 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=68, Invalid=145, Unknown=1, NotChecked=26, Total=240 [2019-11-15 22:31:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17838 states. [2019-11-15 22:31:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17838 to 16029. [2019-11-15 22:31:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16029 states. [2019-11-15 22:31:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16029 states to 16029 states and 20135 transitions. [2019-11-15 22:31:32,516 INFO L78 Accepts]: Start accepts. Automaton has 16029 states and 20135 transitions. Word has length 512 [2019-11-15 22:31:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:32,517 INFO L462 AbstractCegarLoop]: Abstraction has 16029 states and 20135 transitions. [2019-11-15 22:31:32,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:31:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16029 states and 20135 transitions. [2019-11-15 22:31:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-11-15 22:31:32,561 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:32,562 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 5, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:32,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:32,766 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:32,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:32,767 INFO L82 PathProgramCache]: Analyzing trace with hash 76731436, now seen corresponding path program 1 times [2019-11-15 22:31:32,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:32,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318568183] [2019-11-15 22:31:32,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:32,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:32,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3360 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 3006 trivial. 0 not checked. [2019-11-15 22:31:32,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318568183] [2019-11-15 22:31:32,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:32,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:31:32,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293098140] [2019-11-15 22:31:32,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:32,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:32,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:32,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:32,985 INFO L87 Difference]: Start difference. First operand 16029 states and 20135 transitions. Second operand 3 states. [2019-11-15 22:31:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:33,441 INFO L93 Difference]: Finished difference Result 33490 states and 41898 transitions. [2019-11-15 22:31:33,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:33,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 524 [2019-11-15 22:31:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:33,469 INFO L225 Difference]: With dead ends: 33490 [2019-11-15 22:31:33,469 INFO L226 Difference]: Without dead ends: 15881 [2019-11-15 22:31:33,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15881 states. [2019-11-15 22:31:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15881 to 15136. [2019-11-15 22:31:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-15 22:31:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18911 transitions. [2019-11-15 22:31:33,885 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18911 transitions. Word has length 524 [2019-11-15 22:31:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:33,886 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18911 transitions. [2019-11-15 22:31:33,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18911 transitions. [2019-11-15 22:31:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-11-15 22:31:33,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:33,904 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 5, 4, 4, 4, 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, 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-15 22:31:33,904 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:33,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1215376266, now seen corresponding path program 1 times [2019-11-15 22:31:33,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:33,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793752251] [2019-11-15 22:31:33,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:33,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:33,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3548 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-11-15 22:31:34,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793752251] [2019-11-15 22:31:34,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:34,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:31:34,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565530999] [2019-11-15 22:31:34,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:34,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:34,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:34,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:34,337 INFO L87 Difference]: Start difference. First operand 15136 states and 18911 transitions. Second operand 3 states. [2019-11-15 22:31:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:34,652 INFO L93 Difference]: Finished difference Result 29994 states and 37432 transitions. [2019-11-15 22:31:34,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:34,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2019-11-15 22:31:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:34,673 INFO L225 Difference]: With dead ends: 29994 [2019-11-15 22:31:34,674 INFO L226 Difference]: Without dead ends: 15184 [2019-11-15 22:31:34,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2019-11-15 22:31:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15136. [2019-11-15 22:31:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-15 22:31:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18868 transitions. [2019-11-15 22:31:35,037 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18868 transitions. Word has length 536 [2019-11-15 22:31:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:35,037 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18868 transitions. [2019-11-15 22:31:35,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18868 transitions. [2019-11-15 22:31:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-15 22:31:35,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:35,054 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 5, 4, 4, 4, 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, 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-15 22:31:35,055 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:35,055 INFO L82 PathProgramCache]: Analyzing trace with hash -943603990, now seen corresponding path program 1 times [2019-11-15 22:31:35,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:35,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410933193] [2019-11-15 22:31:35,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:35,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:35,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-11-15 22:31:35,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410933193] [2019-11-15 22:31:35,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:35,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:31:35,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969461279] [2019-11-15 22:31:35,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:35,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:35,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:35,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:35,250 INFO L87 Difference]: Start difference. First operand 15136 states and 18868 transitions. Second operand 3 states. [2019-11-15 22:31:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:35,652 INFO L93 Difference]: Finished difference Result 29994 states and 37349 transitions. [2019-11-15 22:31:35,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:35,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-11-15 22:31:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:35,675 INFO L225 Difference]: With dead ends: 29994 [2019-11-15 22:31:35,676 INFO L226 Difference]: Without dead ends: 15184 [2019-11-15 22:31:35,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2019-11-15 22:31:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15136. [2019-11-15 22:31:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-15 22:31:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18825 transitions. [2019-11-15 22:31:36,048 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18825 transitions. Word has length 537 [2019-11-15 22:31:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:36,049 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18825 transitions. [2019-11-15 22:31:36,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18825 transitions. [2019-11-15 22:31:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-11-15 22:31:36,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:36,065 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:36,065 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:36,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:36,066 INFO L82 PathProgramCache]: Analyzing trace with hash 780560607, now seen corresponding path program 1 times [2019-11-15 22:31:36,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:36,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377527000] [2019-11-15 22:31:36,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:36,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:36,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3937 backedges. 2204 proven. 0 refuted. 0 times theorem prover too weak. 1733 trivial. 0 not checked. [2019-11-15 22:31:36,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377527000] [2019-11-15 22:31:36,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:36,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:31:36,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607220094] [2019-11-15 22:31:36,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:31:36,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:31:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:36,415 INFO L87 Difference]: Start difference. First operand 15136 states and 18825 transitions. Second operand 3 states. [2019-11-15 22:31:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:36,709 INFO L93 Difference]: Finished difference Result 30231 states and 37579 transitions. [2019-11-15 22:31:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:31:36,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 580 [2019-11-15 22:31:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:36,727 INFO L225 Difference]: With dead ends: 30231 [2019-11-15 22:31:36,727 INFO L226 Difference]: Without dead ends: 15114 [2019-11-15 22:31:36,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:31:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15114 states. [2019-11-15 22:31:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15114 to 13798. [2019-11-15 22:31:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13798 states. [2019-11-15 22:31:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13798 states to 13798 states and 17082 transitions. [2019-11-15 22:31:37,077 INFO L78 Accepts]: Start accepts. Automaton has 13798 states and 17082 transitions. Word has length 580 [2019-11-15 22:31:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:37,077 INFO L462 AbstractCegarLoop]: Abstraction has 13798 states and 17082 transitions. [2019-11-15 22:31:37,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:31:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 13798 states and 17082 transitions. [2019-11-15 22:31:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-11-15 22:31:37,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:31:37,091 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-15 22:31:37,091 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:31:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1763345373, now seen corresponding path program 2 times [2019-11-15 22:31:37,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:37,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34272348] [2019-11-15 22:31:37,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:37,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:37,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2019-11-15 22:31:37,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34272348] [2019-11-15 22:31:37,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387134898] [2019-11-15 22:31:37,336 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:37,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:31:37,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:31:37,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:31:37,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2019-11-15 22:31:37,734 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:31:37,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:31:37,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540114172] [2019-11-15 22:31:37,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:31:37,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:37,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:31:37,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:31:37,737 INFO L87 Difference]: Start difference. First operand 13798 states and 17082 transitions. Second operand 4 states. [2019-11-15 22:31:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:38,021 INFO L93 Difference]: Finished difference Result 19952 states and 24719 transitions. [2019-11-15 22:31:38,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:31:38,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 582 [2019-11-15 22:31:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:38,022 INFO L225 Difference]: With dead ends: 19952 [2019-11-15 22:31:38,022 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:31:38,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 584 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-15 22:31:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:31:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:31:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:31:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:31:38,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 582 [2019-11-15 22:31:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:38,032 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:31:38,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:31:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:31:38,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:31:38,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:38,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:31:38,360 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 121 [2019-11-15 22:31:40,911 WARN L191 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 809 DAG size of output: 455 [2019-11-15 22:31:42,926 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 810 DAG size of output: 456 [2019-11-15 22:31:43,342 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 43 [2019-11-15 22:31:49,305 WARN L191 SmtUtils]: Spent 5.96 s on a formula simplification. DAG size of input: 372 DAG size of output: 119 [2019-11-15 22:31:58,237 WARN L191 SmtUtils]: Spent 8.93 s on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2019-11-15 22:32:01,511 WARN L191 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 114 DAG size of output: 42 [2019-11-15 22:32:01,737 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 44 [2019-11-15 22:32:02,003 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-15 22:32:02,213 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2019-11-15 22:32:02,414 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 33 [2019-11-15 22:32:02,626 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2019-11-15 22:32:02,970 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 38 [2019-11-15 22:32:08,224 WARN L191 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 120 DAG size of output: 54 [2019-11-15 22:32:08,497 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 38 [2019-11-15 22:32:08,693 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 37 [2019-11-15 22:32:08,948 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-15 22:32:09,229 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 39 [2019-11-15 22:32:09,493 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-15 22:32:09,718 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 41 [2019-11-15 22:32:09,974 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 53 [2019-11-15 22:32:13,513 WARN L191 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 373 DAG size of output: 116 [2019-11-15 22:32:13,832 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 39 [2019-11-15 22:32:13,834 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 667) no Hoare annotation was computed. [2019-11-15 22:32:13,834 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 639) no Hoare annotation was computed. [2019-11-15 22:32:13,834 INFO L443 ceAbstractionStarter]: For program point L663-2(lines 663 667) no Hoare annotation was computed. [2019-11-15 22:32:13,834 INFO L443 ceAbstractionStarter]: For program point L630-2(lines 629 651) no Hoare annotation was computed. [2019-11-15 22:32:13,834 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 469) no Hoare annotation was computed. [2019-11-15 22:32:13,834 INFO L443 ceAbstractionStarter]: For program point L333-1(lines 333 342) no Hoare annotation was computed. [2019-11-15 22:32:13,835 INFO L439 ceAbstractionStarter]: At program point L168(lines 167 606) the Hoare annotation is: (let ((.cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse7 (not .cse5)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse4 (let ((.cse9 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse9) (<= .cse9 8496))))) (or (and .cse0 .cse1 .cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (and (and .cse3 .cse2 .cse4 .cse5) .cse6) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3 .cse2 .cse7) (and .cse2 .cse0 .cse4) (and .cse0 .cse6 .cse2) (and .cse8 .cse2 .cse7) (and .cse8 .cse1 .cse2 .cse4)))) [2019-11-15 22:32:13,835 INFO L439 ceAbstractionStarter]: At program point L135(lines 128 619) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse7 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse7 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse7) (<= .cse7 2147483647))))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 (let ((.cse5 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse5) (<= .cse5 8496)))) .cse6) (and .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse0 .cse1 .cse3 .cse6))) [2019-11-15 22:32:13,835 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 22:32:13,835 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 636) no Hoare annotation was computed. [2019-11-15 22:32:13,835 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 594) no Hoare annotation was computed. [2019-11-15 22:32:13,835 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 605) no Hoare annotation was computed. [2019-11-15 22:32:13,835 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 616) no Hoare annotation was computed. [2019-11-15 22:32:13,835 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 627) no Hoare annotation was computed. [2019-11-15 22:32:13,836 INFO L439 ceAbstractionStarter]: At program point L204(lines 200 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (let ((.cse2 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse2) (<= .cse2 8496)))))) [2019-11-15 22:32:13,836 INFO L439 ceAbstractionStarter]: At program point L105(lines 104 627) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:32:13,836 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-15 22:32:13,836 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 481) no Hoare annotation was computed. [2019-11-15 22:32:13,836 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 441) no Hoare annotation was computed. [2019-11-15 22:32:13,836 INFO L439 ceAbstractionStarter]: At program point L371(lines 354 389) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 .cse1 (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-15 22:32:13,836 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 244) no Hoare annotation was computed. [2019-11-15 22:32:13,836 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 593) no Hoare annotation was computed. [2019-11-15 22:32:13,837 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 604) no Hoare annotation was computed. [2019-11-15 22:32:13,837 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 615) no Hoare annotation was computed. [2019-11-15 22:32:13,837 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 626) no Hoare annotation was computed. [2019-11-15 22:32:13,837 INFO L439 ceAbstractionStarter]: At program point L405(lines 396 427) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-15 22:32:13,837 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:32:13,837 INFO L439 ceAbstractionStarter]: At program point L174(lines 170 605) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)))) (or (and .cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1))) (and .cse0 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))))) [2019-11-15 22:32:13,837 INFO L439 ceAbstractionStarter]: At program point L141(lines 137 616) the Hoare annotation is: (let ((.cse8 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (let ((.cse7 (< 2147483647 .cse8))) (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (or (<= .cse8 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= .cse8 (+ ULTIMATE.start_ssl3_accept_~s__state~0 4294967296)) .cse7))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (or .cse7 (<= .cse8 8496)))) (or (and .cse0 (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4) .cse5) (and .cse6 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse5 (and .cse1 .cse2 (and .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3) .cse4)))))) [2019-11-15 22:32:13,837 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 83) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 377) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 603) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 614) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 625) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 583) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 573 583) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 478) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-11-15 22:32:13,838 INFO L439 ceAbstractionStarter]: At program point L210(lines 209 592) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 82) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 318) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L446 ceAbstractionStarter]: At program point L674(lines 66 676) the Hoare annotation is: true [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 647) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 547) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 602) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 613) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 624) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L446 ceAbstractionStarter]: At program point L675(lines 9 677) the Hoare annotation is: true [2019-11-15 22:32:13,839 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 580) no Hoare annotation was computed. [2019-11-15 22:32:13,839 INFO L439 ceAbstractionStarter]: At program point L180(lines 176 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))) (and (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse3))) [2019-11-15 22:32:13,840 INFO L439 ceAbstractionStarter]: At program point L147(lines 143 614) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse2 .cse0 .cse1) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-15 22:32:13,840 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-11-15 22:32:13,840 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 670) no Hoare annotation was computed. [2019-11-15 22:32:13,840 INFO L443 ceAbstractionStarter]: For program point L313-2(lines 211 589) no Hoare annotation was computed. [2019-11-15 22:32:13,840 INFO L439 ceAbstractionStarter]: At program point L214(lines 107 626) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:32:13,840 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 601) no Hoare annotation was computed. [2019-11-15 22:32:13,840 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 612) no Hoare annotation was computed. [2019-11-15 22:32:13,840 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 623) no Hoare annotation was computed. [2019-11-15 22:32:13,840 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-11-15 22:32:13,840 INFO L443 ceAbstractionStarter]: For program point L513-2(lines 513 517) no Hoare annotation was computed. [2019-11-15 22:32:13,840 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 447 459) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L439 ceAbstractionStarter]: At program point L415(lines 406 426) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 353) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point L349-2(lines 211 589) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 93) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 66 676) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 600) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 611) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 622) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 90) no Hoare annotation was computed. [2019-11-15 22:32:13,841 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 455) no Hoare annotation was computed. [2019-11-15 22:32:13,842 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 223) no Hoare annotation was computed. [2019-11-15 22:32:13,842 INFO L439 ceAbstractionStarter]: At program point L186(lines 182 601) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (let ((.cse0 (and (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (and .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse5 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (let ((.cse6 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse6) (<= .cse6 8496))))) (or (and .cse0 .cse1) (and .cse2 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse5) (and .cse2 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1)))) [2019-11-15 22:32:13,842 INFO L439 ceAbstractionStarter]: At program point L153(lines 149 612) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 .cse1 (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-15 22:32:13,842 INFO L443 ceAbstractionStarter]: For program point L219-2(lines 211 589) no Hoare annotation was computed. [2019-11-15 22:32:13,842 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-15 22:32:13,842 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 599) no Hoare annotation was computed. [2019-11-15 22:32:13,842 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 610) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 621) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 490) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L439 ceAbstractionStarter]: At program point L123(lines 119 622) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse6 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse6) (<= .cse6 2147483647))))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (let ((.cse5 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse5) (<= .cse5 8496))))) (or (and .cse0 .cse1 .cse2 (and .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse3 .cse2))) [2019-11-15 22:32:13,843 INFO L439 ceAbstractionStarter]: At program point L553(lines 66 676) the Hoare annotation is: false [2019-11-15 22:32:13,843 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 270) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 262) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 598) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 609) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 620) no Hoare annotation was computed. [2019-11-15 22:32:13,843 INFO L446 ceAbstractionStarter]: At program point L687(lines 678 689) the Hoare annotation is: true [2019-11-15 22:32:13,844 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 388) no Hoare annotation was computed. [2019-11-15 22:32:13,844 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-11-15 22:32:13,844 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 324 328) no Hoare annotation was computed. [2019-11-15 22:32:13,844 INFO L439 ceAbstractionStarter]: At program point L192(lines 188 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))) (and .cse0 .cse2 .cse1 .cse3 .cse5) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse3 .cse5))) [2019-11-15 22:32:13,844 INFO L439 ceAbstractionStarter]: At program point L159(lines 155 610) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-15 22:32:13,844 INFO L439 ceAbstractionStarter]: At program point L126(lines 125 620) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse2 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse4 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse4 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse4) (<= .cse4 2147483647))))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse0 (not .cse1)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 .cse0 .cse1) (and .cse2 .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2019-11-15 22:32:13,844 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-11-15 22:32:13,844 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L439 ceAbstractionStarter]: At program point L590(lines 101 658) the Hoare annotation is: (let ((.cse22 (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2))) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (.cse9 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse20 (and .cse19 .cse5 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse17 (and .cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse10 (not .cse6)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse18 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (let ((.cse24 (mod .cse22 4294967296))) (or (< 2147483647 .cse24) (<= .cse24 8496)))) (.cse23 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse4) (and .cse9 .cse5 .cse8 .cse10) (and .cse9 .cse5 .cse11 .cse10) (and .cse12 .cse8 .cse1) (and .cse13 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse14 .cse15) (and .cse13 .cse12 .cse8 .cse6) (and (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse16 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse16 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse16) (<= .cse16 2147483647)))) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse17 .cse18) (and .cse2 .cse13 .cse14 .cse4) (and .cse1 .cse4) (and .cse19 .cse1 .cse11) (and .cse2 .cse13 .cse19 .cse11 .cse4) (and .cse20 .cse10) (and (and .cse13 .cse20) .cse4) (and .cse1 .cse13 .cse8 .cse15) (and .cse21 .cse17) (and .cse2 .cse21 .cse13 .cse4) (and (= (+ ULTIMATE.start_ssl3_accept_~s__state~0 (* 4294967296 (div .cse22 4294967296))) (+ (* 2 ULTIMATE.start_ssl3_accept_~ag_Y~0) (* 2 ULTIMATE.start_ssl3_accept_~ag_X~0))) .cse1) (and .cse2 .cse10) (and .cse1 .cse7 .cse8) (and .cse3 .cse1) (and (and .cse2 .cse23) .cse4) (and .cse2 .cse18 .cse13 .cse4) (and .cse23 .cse1)))) [2019-11-15 22:32:13,845 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 561) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 211 589) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 597) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 608) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 619) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 387) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L443 ceAbstractionStarter]: For program point L360-1(lines 360 387) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 384) no Hoare annotation was computed. [2019-11-15 22:32:13,845 INFO L446 ceAbstractionStarter]: At program point L659(lines 100 660) the Hoare annotation is: true [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 596) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 607) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 618) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 427) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 248) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L439 ceAbstractionStarter]: At program point L198(lines 194 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))) (and .cse3 .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-15 22:32:13,846 INFO L439 ceAbstractionStarter]: At program point L165(lines 161 608) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse2) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L231-2(lines 211 589) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 656) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 403) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L364(lines 364 383) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 653) no Hoare annotation was computed. [2019-11-15 22:32:13,846 INFO L443 ceAbstractionStarter]: For program point L563(lines 563 567) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 501) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L563-2(lines 563 567) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 211 589) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L365-2(lines 364 381) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 238) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 595) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 606) no Hoare annotation was computed. [2019-11-15 22:32:13,847 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 617) no Hoare annotation was computed. [2019-11-15 22:32:13,848 INFO L439 ceAbstractionStarter]: At program point L101-2(lines 101 658) the Hoare annotation is: (let ((.cse21 (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2))) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (.cse9 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse19 (and .cse18 .cse5 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse16 (and .cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1)) (.cse20 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse10 (not .cse6)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse17 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (let ((.cse24 (mod .cse21 4294967296))) (or (< 2147483647 .cse24) (<= .cse24 8496)))) (.cse22 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse4) (and .cse9 .cse5 .cse8 .cse10) (and .cse9 .cse5 .cse11 .cse10) (and .cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse13 .cse14) (and .cse12 .cse15 .cse8 .cse6) (and .cse16 .cse17) (and .cse2 .cse12 .cse13 .cse4) (and .cse1 .cse4) (and .cse18 .cse1 .cse11) (and .cse2 .cse12 .cse18 .cse11 .cse4) (and .cse19 .cse10) (and (and .cse12 .cse19) .cse4) (and .cse1 .cse12 .cse8 .cse14) (and .cse20 .cse16) (and .cse2 .cse20 .cse12 .cse4) (and (= (+ ULTIMATE.start_ssl3_accept_~s__state~0 (* 4294967296 (div .cse21 4294967296))) (+ (* 2 ULTIMATE.start_ssl3_accept_~ag_Y~0) (* 2 ULTIMATE.start_ssl3_accept_~ag_X~0))) .cse1) (and .cse2 .cse10) (and .cse1 .cse7 .cse8) (and .cse3 .cse1) (and (and .cse2 .cse22) .cse4) (and .cse2 .cse17 .cse12 .cse4) (and .cse22 .cse1) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) .cse15 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse23 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse23 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse23) (<= .cse23 2147483647)))) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))))) [2019-11-15 22:32:13,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:13,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:13,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:32:13 BoogieIcfgContainer [2019-11-15 22:32:13,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:32:13,931 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:32:13,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:32:13,932 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:32:13,932 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:30:57" (3/4) ... [2019-11-15 22:32:13,936 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:32:13,954 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:32:13,955 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:32:13,989 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1)) || (((((!(s__state == 8481) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) && !(s__state == 8480)) [2019-11-15 22:32:13,990 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8496) && blastFlag <= 1) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) [2019-11-15 22:32:13,990 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && 0 == s__hit)) || (((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) [2019-11-15 22:32:13,991 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((!(s__state == 8448) && s__state <= 8448) && blastFlag <= 1)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || (((((8466 <= s__state && blastFlag <= 1) && !(s__state == 8481)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && !(s__state == 8480))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1) [2019-11-15 22:32:13,991 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(s__state == 8481) && !(s__state == 8448)) && (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((!(s__state == 8496) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8480)) [2019-11-15 22:32:14,060 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1245ab2b-055c-46e0-b70e-c306da75880b/bin/uautomizer/witness.graphml [2019-11-15 22:32:14,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:32:14,061 INFO L168 Benchmark]: Toolchain (without parser) took 77798.96 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 950.2 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 748.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,062 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:32:14,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.2 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.10 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-15 22:32:14,063 INFO L168 Benchmark]: Boogie Preprocessor took 40.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,063 INFO L168 Benchmark]: RCFGBuilder took 873.17 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,063 INFO L168 Benchmark]: TraceAbstraction took 76228.22 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,064 INFO L168 Benchmark]: Witness Printer took 128.98 ms. Allocated memory is still 3.1 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,065 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 462.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.2 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 873.17 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76228.22 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 128.98 ms. Allocated memory is still 3.1 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 670]: 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: 182]: Loop Invariant Derived loop invariant: ((((8576 <= s__state && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || ((8576 <= s__state && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 101]: Loop Invariant [2019-11-15 22:32:14,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((!(s__state == 8448) && s__state <= 8448) && blastFlag <= 1)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || (((((8466 <= s__state && blastFlag <= 1) && !(s__state == 8481)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && !(s__state == 8480))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant [2019-11-15 22:32:14,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((!(s__state == 8481) && !(s__state == 8448)) && (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((!(s__state == 8496) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8480)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) || ((((blastFlag <= 3 && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3)) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || ((s__state <= 8448 && blastFlag <= 1) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || ((blastFlag <= 2 && s__state <= 8448) && !(0 == s__hit))) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 125]: Loop Invariant [2019-11-15 22:32:14,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && 0 == s__hit)) || (((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && blastFlag <= 2) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((8512 <= s__state && blastFlag <= 2) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8656 <= s__state) && !(0 == s__hit)) || (blastFlag <= 1 && 8656 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576)) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 119]: Loop Invariant [2019-11-15 22:32:14,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8496) && blastFlag <= 1) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__state == 8672)) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) || ((((!(s__state == 8673) && blastFlag <= 3) && !(s__state == 8672)) && 8656 <= s__state) && !(0 == s__hit))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8656 <= s__state) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && blastFlag <= 2) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((8512 <= s__state && blastFlag <= 2) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((((blastFlag <= 2 && 8576 <= s__state) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8576 <= s__state) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && blastFlag <= 2) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((8512 <= s__state && blastFlag <= 2) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 2 && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) || ((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8640 <= s__state)) || (((((8640 <= s__s3__tmp__next_state___0 && !(s__state == 8673)) && blastFlag <= 3) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((!(s__state == 8481) && (((8466 <= s__state && ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state || ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state + 4294967296 && 2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296))) && blastFlag <= 1) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8480)) || ((blastFlag <= 2 && !(s__state == 8673) && !(s__state == 8672)) && !(0 == s__hit))) || ((!(s__state == 8481) && !(s__state == 8480)) && ((8466 <= s__state && ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state || ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state + 4294967296 && 2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296))) && (blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 101]: Loop Invariant [2019-11-15 22:32:14,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:32:14,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:32:14,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1)) || (((((!(s__state == 8481) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) && !(s__state == 8480)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (8576 <= s__state && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 76.0s, OverallIterations: 29, TraceHistogramMax: 21, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.5s, HoareTripleCheckerStatistics: 5783 SDtfs, 3193 SDslu, 4200 SDs, 0 SdLazy, 4250 SolverSat, 665 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3420 GetRequests, 3362 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16029occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 10200 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 955 NumberOfFragments, 2969 HoareAnnotationTreeSize, 29 FomulaSimplifications, 204025 FormulaSimplificationTreeSizeReduction, 4.7s HoareSimplificationTime, 29 FomulaSimplificationsInter, 92428 FormulaSimplificationTreeSizeReductionInter, 30.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 11805 NumberOfCodeBlocks, 11805 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 11768 ConstructedInterpolants, 35 QuantifiedInterpolants, 10985739 SizeOfPredicates, 13 NumberOfNonLiveVariables, 5190 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 37 InterpolantComputations, 24 PerfectInterpolantSequences, 56363/57069 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...