./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1-2a.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_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/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 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/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 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:42:13,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:42:13,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:42:13,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:42:13,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:42:13,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:42:13,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:42:13,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:42:13,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:42:13,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:42:13,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:42:13,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:42:13,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:42:13,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:42:13,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:42:13,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:42:13,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:42:13,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:42:13,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:42:13,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:42:13,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:42:13,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:42:13,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:42:13,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:42:13,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:42:13,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:42:13,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:42:13,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:42:13,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:42:13,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:42:13,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:42:13,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:42:13,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:42:13,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:42:13,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:42:13,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:42:13,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:42:13,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:42:13,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:42:13,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:42:13,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:42:13,491 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:42:13,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:42:13,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:42:13,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:42:13,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:42:13,516 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:42:13,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:42:13,516 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:42:13,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:42:13,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:42:13,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:42:13,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:42:13,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:42:13,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:42:13,519 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:42:13,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:42:13,520 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:42:13,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:42:13,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:42:13,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:42:13,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:42:13,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:42:13,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:42:13,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:42:13,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:42:13,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:42:13,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:42:13,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:42:13,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:42:13,523 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_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/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 -> 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 [2019-11-16 00:42:13,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:42:13,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:42:13,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:42:13,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:42:13,605 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:42:13,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-16 00:42:13,662 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data/23af01c65/48e6018f5e624647a22814d4ae0036bb/FLAG7f8980324 [2019-11-16 00:42:14,103 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:42:14,103 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-16 00:42:14,111 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data/23af01c65/48e6018f5e624647a22814d4ae0036bb/FLAG7f8980324 [2019-11-16 00:42:14,127 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data/23af01c65/48e6018f5e624647a22814d4ae0036bb [2019-11-16 00:42:14,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:42:14,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:42:14,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:42:14,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:42:14,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:42:14,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25dcc246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14, skipping insertion in model container [2019-11-16 00:42:14,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,148 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:42:14,200 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:42:14,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:42:14,549 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:42:14,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:42:14,605 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:42:14,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14 WrapperNode [2019-11-16 00:42:14,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:42:14,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:42:14,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:42:14,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:42:14,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:42:14,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:42:14,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:42:14,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:42:14,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... [2019-11-16 00:42:14,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:42:14,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:42:14,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:42:14,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:42:14,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/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-16 00:42:14,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:42:14,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:42:15,260 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:42:15,260 INFO L284 CfgBuilder]: Removed 28 assume(true) statements. [2019-11-16 00:42:15,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:15 BoogieIcfgContainer [2019-11-16 00:42:15,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:42:15,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:42:15,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:42:15,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:42:15,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:42:14" (1/3) ... [2019-11-16 00:42:15,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74efe6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:15, skipping insertion in model container [2019-11-16 00:42:15,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:14" (2/3) ... [2019-11-16 00:42:15,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74efe6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:15, skipping insertion in model container [2019-11-16 00:42:15,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:15" (3/3) ... [2019-11-16 00:42:15,269 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2019-11-16 00:42:15,277 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:42:15,284 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-16 00:42:15,294 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-16 00:42:15,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:42:15,314 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:42:15,314 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:42:15,314 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:42:15,314 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:42:15,315 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:42:15,315 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:42:15,315 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:42:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-11-16 00:42:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:42:15,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:15,335 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:15,336 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:15,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:15,342 INFO L82 PathProgramCache]: Analyzing trace with hash 934616753, now seen corresponding path program 1 times [2019-11-16 00:42:15,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:15,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69291974] [2019-11-16 00:42:15,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:15,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:15,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:15,697 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-16 00:42:15,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69291974] [2019-11-16 00:42:15,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:15,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:42:15,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603726686] [2019-11-16 00:42:15,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:42:15,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:15,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:42:15,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:15,719 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 8 states. [2019-11-16 00:42:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:16,367 INFO L93 Difference]: Finished difference Result 434 states and 663 transitions. [2019-11-16 00:42:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:42:16,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-16 00:42:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:16,384 INFO L225 Difference]: With dead ends: 434 [2019-11-16 00:42:16,384 INFO L226 Difference]: Without dead ends: 321 [2019-11-16 00:42:16,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:42:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-16 00:42:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 127. [2019-11-16 00:42:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-16 00:42:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2019-11-16 00:42:16,468 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 17 [2019-11-16 00:42:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:16,469 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2019-11-16 00:42:16,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:42:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2019-11-16 00:42:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:42:16,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:16,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:16,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:16,475 INFO L82 PathProgramCache]: Analyzing trace with hash 934676335, now seen corresponding path program 1 times [2019-11-16 00:42:16,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:16,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216397413] [2019-11-16 00:42:16,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:16,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:16,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:16,648 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-16 00:42:16,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216397413] [2019-11-16 00:42:16,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:16,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:42:16,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655318039] [2019-11-16 00:42:16,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:42:16,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:42:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:16,651 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand 7 states. [2019-11-16 00:42:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:16,937 INFO L93 Difference]: Finished difference Result 276 states and 396 transitions. [2019-11-16 00:42:16,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:42:16,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-16 00:42:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:16,940 INFO L225 Difference]: With dead ends: 276 [2019-11-16 00:42:16,940 INFO L226 Difference]: Without dead ends: 198 [2019-11-16 00:42:16,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:42:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-16 00:42:16,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-11-16 00:42:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-16 00:42:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 267 transitions. [2019-11-16 00:42:16,975 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 267 transitions. Word has length 17 [2019-11-16 00:42:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:16,975 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 267 transitions. [2019-11-16 00:42:16,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:42:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 267 transitions. [2019-11-16 00:42:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:42:16,978 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:16,978 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] [2019-11-16 00:42:16,979 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:16,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:16,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1341099622, now seen corresponding path program 1 times [2019-11-16 00:42:16,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:16,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575723681] [2019-11-16 00:42:16,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:16,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:16,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:17,211 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-16 00:42:17,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575723681] [2019-11-16 00:42:17,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:17,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:42:17,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829144392] [2019-11-16 00:42:17,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:42:17,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:17,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:42:17,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:17,213 INFO L87 Difference]: Start difference. First operand 187 states and 267 transitions. Second operand 8 states. [2019-11-16 00:42:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:17,608 INFO L93 Difference]: Finished difference Result 296 states and 396 transitions. [2019-11-16 00:42:17,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:42:17,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-16 00:42:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:17,613 INFO L225 Difference]: With dead ends: 296 [2019-11-16 00:42:17,613 INFO L226 Difference]: Without dead ends: 252 [2019-11-16 00:42:17,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:42:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-16 00:42:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 178. [2019-11-16 00:42:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-16 00:42:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 252 transitions. [2019-11-16 00:42:17,654 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 252 transitions. Word has length 21 [2019-11-16 00:42:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:17,655 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 252 transitions. [2019-11-16 00:42:17,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:42:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 252 transitions. [2019-11-16 00:42:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:42:17,659 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:17,659 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] [2019-11-16 00:42:17,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1019232809, now seen corresponding path program 1 times [2019-11-16 00:42:17,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:17,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347460104] [2019-11-16 00:42:17,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:17,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:17,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:17,707 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-16 00:42:17,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347460104] [2019-11-16 00:42:17,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:17,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:17,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782479706] [2019-11-16 00:42:17,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:17,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:17,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:17,708 INFO L87 Difference]: Start difference. First operand 178 states and 252 transitions. Second operand 3 states. [2019-11-16 00:42:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:17,730 INFO L93 Difference]: Finished difference Result 328 states and 464 transitions. [2019-11-16 00:42:17,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:17,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-16 00:42:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:17,732 INFO L225 Difference]: With dead ends: 328 [2019-11-16 00:42:17,732 INFO L226 Difference]: Without dead ends: 253 [2019-11-16 00:42:17,733 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-16 00:42:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-16 00:42:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2019-11-16 00:42:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-16 00:42:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2019-11-16 00:42:17,747 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 25 [2019-11-16 00:42:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:17,748 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2019-11-16 00:42:17,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2019-11-16 00:42:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:42:17,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:17,750 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] [2019-11-16 00:42:17,750 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash 186737553, now seen corresponding path program 1 times [2019-11-16 00:42:17,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:17,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304274505] [2019-11-16 00:42:17,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:17,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:17,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:17,892 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-16 00:42:17,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304274505] [2019-11-16 00:42:17,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:17,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:42:17,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063611637] [2019-11-16 00:42:17,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:17,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:17,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:17,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:17,895 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand 6 states. [2019-11-16 00:42:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:18,081 INFO L93 Difference]: Finished difference Result 348 states and 479 transitions. [2019-11-16 00:42:18,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:42:18,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-16 00:42:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:18,084 INFO L225 Difference]: With dead ends: 348 [2019-11-16 00:42:18,084 INFO L226 Difference]: Without dead ends: 189 [2019-11-16 00:42:18,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:42:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-16 00:42:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2019-11-16 00:42:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-16 00:42:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 244 transitions. [2019-11-16 00:42:18,096 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 244 transitions. Word has length 25 [2019-11-16 00:42:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:18,097 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 244 transitions. [2019-11-16 00:42:18,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 244 transitions. [2019-11-16 00:42:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:42:18,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:18,098 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] [2019-11-16 00:42:18,099 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash 501595191, now seen corresponding path program 1 times [2019-11-16 00:42:18,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:18,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899763889] [2019-11-16 00:42:18,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:18,172 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-16 00:42:18,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899763889] [2019-11-16 00:42:18,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:18,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:42:18,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714210857] [2019-11-16 00:42:18,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:42:18,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:18,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:42:18,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:42:18,174 INFO L87 Difference]: Start difference. First operand 178 states and 244 transitions. Second operand 5 states. [2019-11-16 00:42:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:18,273 INFO L93 Difference]: Finished difference Result 305 states and 422 transitions. [2019-11-16 00:42:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:18,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-16 00:42:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:18,275 INFO L225 Difference]: With dead ends: 305 [2019-11-16 00:42:18,276 INFO L226 Difference]: Without dead ends: 230 [2019-11-16 00:42:18,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-16 00:42:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 184. [2019-11-16 00:42:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-16 00:42:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 245 transitions. [2019-11-16 00:42:18,295 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 245 transitions. Word has length 29 [2019-11-16 00:42:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:18,295 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 245 transitions. [2019-11-16 00:42:18,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:42:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 245 transitions. [2019-11-16 00:42:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:42:18,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:18,298 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] [2019-11-16 00:42:18,298 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1737423153, now seen corresponding path program 1 times [2019-11-16 00:42:18,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:18,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213688868] [2019-11-16 00:42:18,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:18,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:42:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:42:18,421 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:42:18,421 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:42:18,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:42:18 BoogieIcfgContainer [2019-11-16 00:42:18,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:42:18,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:42:18,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:42:18,468 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:42:18,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:15" (3/4) ... [2019-11-16 00:42:18,473 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:42:18,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:42:18,476 INFO L168 Benchmark]: Toolchain (without parser) took 4343.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -236.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:18,476 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:18,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:18,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.62 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:18,483 INFO L168 Benchmark]: Boogie Preprocessor took 34.58 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-16 00:42:18,484 INFO L168 Benchmark]: RCFGBuilder took 571.67 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: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:18,485 INFO L168 Benchmark]: TraceAbstraction took 3204.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:18,485 INFO L168 Benchmark]: Witness Printer took 5.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:18,491 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 473.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.62 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 571.67 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: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3204.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 99. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add ; [L224] unsigned int zero ; [L225] int sa ; [L226] int sb ; [L227] int tmp ; [L228] int tmp___0 ; [L229] int tmp___1 ; [L230] int tmp___2 ; [L231] int tmp___3 ; [L232] int tmp___4 ; [L233] int tmp___5 ; [L234] int tmp___6 ; [L235] int tmp___7 ; [L236] int tmp___8 ; [L237] int tmp___9 ; [L238] int __retres23 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L242] zero = base2flt(0, 0) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] res = m | ((unsigned int ) (e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L243] a = base2flt(ma, ea) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] res = m | ((unsigned int ) (e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L244] b = base2flt(mb, eb) [L246] COND FALSE !(a < zero) [L249] COND TRUE a > zero [L250] tmp = 1 [L254] sa = tmp [L256] COND FALSE !(b < zero) [L259] COND TRUE b > zero [L260] tmp___0 = 1 [L264] sb = tmp___0 [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; [L85] COND TRUE a < b [L86] tmp = a [L87] a = b [L88] b = tmp [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] eb = (int )(b >> 24U) - 128 [L104] mb = mb | (1U << 24U) [L7] COND TRUE !(cond) [L8] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 5 error locations. Result: UNSAFE, OverallTime: 3.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 652 SDtfs, 2011 SDslu, 2328 SDs, 0 SdLazy, 601 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 363 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 12000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:42:20,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:42:20,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:42:20,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:42:20,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:42:20,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:42:20,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:42:20,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:42:20,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:42:20,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:42:20,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:42:20,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:42:20,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:42:20,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:42:20,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:42:20,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:42:20,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:42:20,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:42:20,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:42:20,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:42:20,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:42:20,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:42:20,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:42:20,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:42:20,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:42:20,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:42:20,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:42:20,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:42:20,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:42:20,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:42:20,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:42:20,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:42:20,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:42:20,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:42:20,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:42:20,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:42:20,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:42:20,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:42:20,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:42:20,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:42:20,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:42:20,814 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:42:20,840 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:42:20,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:42:20,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:42:20,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:42:20,842 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:42:20,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:42:20,842 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:42:20,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:42:20,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:42:20,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:42:20,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:42:20,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:42:20,844 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:42:20,844 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:42:20,844 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:42:20,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:42:20,845 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:42:20,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:42:20,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:42:20,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:42:20,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:42:20,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:42:20,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:42:20,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:42:20,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:42:20,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:42:20,847 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:42:20,847 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:42:20,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:42:20,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:42:20,848 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/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 -> 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 [2019-11-16 00:42:20,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:42:20,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:42:20,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:42:20,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:42:20,898 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:42:20,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-16 00:42:20,959 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data/d7cd0cdcb/cc710cf2d6ac43949d168f5a8d5123ff/FLAGbb74690c2 [2019-11-16 00:42:21,360 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:42:21,360 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-16 00:42:21,367 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data/d7cd0cdcb/cc710cf2d6ac43949d168f5a8d5123ff/FLAGbb74690c2 [2019-11-16 00:42:21,741 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/data/d7cd0cdcb/cc710cf2d6ac43949d168f5a8d5123ff [2019-11-16 00:42:21,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:42:21,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:42:21,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:42:21,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:42:21,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:42:21,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:21" (1/1) ... [2019-11-16 00:42:21,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256b2940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:21, skipping insertion in model container [2019-11-16 00:42:21,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:21" (1/1) ... [2019-11-16 00:42:21,761 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:42:21,811 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:42:22,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:42:22,042 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:42:22,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:42:22,194 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:42:22,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22 WrapperNode [2019-11-16 00:42:22,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:42:22,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:42:22,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:42:22,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:42:22,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... [2019-11-16 00:42:22,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... [2019-11-16 00:42:22,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:42:22,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:42:22,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:42:22,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:42:22,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... [2019-11-16 00:42:22,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... [2019-11-16 00:42:22,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... [2019-11-16 00:42:22,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... [2019-11-16 00:42:22,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... [2019-11-16 00:42:22,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... [2019-11-16 00:42:22,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... [2019-11-16 00:42:22,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:42:22,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:42:22,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:42:22,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:42:22,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/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-16 00:42:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:42:22,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:42:23,032 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:42:23,032 INFO L284 CfgBuilder]: Removed 28 assume(true) statements. [2019-11-16 00:42:23,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:23 BoogieIcfgContainer [2019-11-16 00:42:23,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:42:23,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:42:23,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:42:23,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:42:23,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:42:21" (1/3) ... [2019-11-16 00:42:23,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6f6da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:23, skipping insertion in model container [2019-11-16 00:42:23,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:22" (2/3) ... [2019-11-16 00:42:23,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6f6da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:23, skipping insertion in model container [2019-11-16 00:42:23,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:23" (3/3) ... [2019-11-16 00:42:23,041 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2019-11-16 00:42:23,051 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:42:23,058 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-16 00:42:23,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-16 00:42:23,091 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:42:23,091 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:42:23,091 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:42:23,091 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:42:23,091 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:42:23,092 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:42:23,092 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:42:23,092 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:42:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-11-16 00:42:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:42:23,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:23,115 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:23,117 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:23,123 INFO L82 PathProgramCache]: Analyzing trace with hash 934616753, now seen corresponding path program 1 times [2019-11-16 00:42:23,134 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:23,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1239655594] [2019-11-16 00:42:23,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:23,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:23,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:23,368 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-16 00:42:23,372 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:23,384 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-16 00:42:23,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1239655594] [2019-11-16 00:42:23,386 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:23,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-16 00:42:23,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604308644] [2019-11-16 00:42:23,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:42:23,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:23,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:42:23,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:23,403 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 7 states. [2019-11-16 00:42:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:24,028 INFO L93 Difference]: Finished difference Result 485 states and 736 transitions. [2019-11-16 00:42:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:42:24,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-16 00:42:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:24,059 INFO L225 Difference]: With dead ends: 485 [2019-11-16 00:42:24,059 INFO L226 Difference]: Without dead ends: 371 [2019-11-16 00:42:24,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:42:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-16 00:42:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 126. [2019-11-16 00:42:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:42:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2019-11-16 00:42:24,150 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 17 [2019-11-16 00:42:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:24,153 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2019-11-16 00:42:24,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:42:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2019-11-16 00:42:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:42:24,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:24,156 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] [2019-11-16 00:42:24,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:24,359 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:24,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash 216177638, now seen corresponding path program 1 times [2019-11-16 00:42:24,360 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:24,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1473883503] [2019-11-16 00:42:24,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:24,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:42:24,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:24,460 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-16 00:42:24,460 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:24,480 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-16 00:42:24,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1473883503] [2019-11-16 00:42:24,481 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:24,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-16 00:42:24,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635543999] [2019-11-16 00:42:24,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:42:24,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:42:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:42:24,484 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand 5 states. [2019-11-16 00:42:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:24,708 INFO L93 Difference]: Finished difference Result 481 states and 685 transitions. [2019-11-16 00:42:24,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:42:24,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-16 00:42:24,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:24,713 INFO L225 Difference]: With dead ends: 481 [2019-11-16 00:42:24,714 INFO L226 Difference]: Without dead ends: 408 [2019-11-16 00:42:24,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-16 00:42:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 171. [2019-11-16 00:42:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:42:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 247 transitions. [2019-11-16 00:42:24,766 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 247 transitions. Word has length 21 [2019-11-16 00:42:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:24,767 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 247 transitions. [2019-11-16 00:42:24,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:42:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2019-11-16 00:42:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:42:24,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:24,776 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] [2019-11-16 00:42:24,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:24,987 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1163788538, now seen corresponding path program 1 times [2019-11-16 00:42:24,988 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:24,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [18865874] [2019-11-16 00:42:24,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:25,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:42:25,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:25,081 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-16 00:42:25,081 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:25,095 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-16 00:42:25,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [18865874] [2019-11-16 00:42:25,096 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:25,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-16 00:42:25,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374845851] [2019-11-16 00:42:25,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:42:25,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:25,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:42:25,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:42:25,098 INFO L87 Difference]: Start difference. First operand 171 states and 247 transitions. Second operand 5 states. [2019-11-16 00:42:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:25,252 INFO L93 Difference]: Finished difference Result 335 states and 471 transitions. [2019-11-16 00:42:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:42:25,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-16 00:42:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:25,255 INFO L225 Difference]: With dead ends: 335 [2019-11-16 00:42:25,255 INFO L226 Difference]: Without dead ends: 266 [2019-11-16 00:42:25,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-16 00:42:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 251. [2019-11-16 00:42:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:42:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 359 transitions. [2019-11-16 00:42:25,273 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 359 transitions. Word has length 25 [2019-11-16 00:42:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:25,274 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 359 transitions. [2019-11-16 00:42:25,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:42:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 359 transitions. [2019-11-16 00:42:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:42:25,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:25,276 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] [2019-11-16 00:42:25,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:25,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:25,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:25,480 INFO L82 PathProgramCache]: Analyzing trace with hash 611218824, now seen corresponding path program 1 times [2019-11-16 00:42:25,480 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:25,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [192808344] [2019-11-16 00:42:25,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:25,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:42:25,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:25,609 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-16 00:42:25,610 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:25,724 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-16 00:42:25,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [192808344] [2019-11-16 00:42:25,725 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:25,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-16 00:42:25,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746932147] [2019-11-16 00:42:25,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:42:25,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:42:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:25,727 INFO L87 Difference]: Start difference. First operand 251 states and 359 transitions. Second operand 8 states. [2019-11-16 00:42:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:28,080 INFO L93 Difference]: Finished difference Result 1039 states and 1474 transitions. [2019-11-16 00:42:28,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:42:28,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-16 00:42:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:28,088 INFO L225 Difference]: With dead ends: 1039 [2019-11-16 00:42:28,088 INFO L226 Difference]: Without dead ends: 928 [2019-11-16 00:42:28,089 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:42:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-11-16 00:42:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 271. [2019-11-16 00:42:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-16 00:42:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 385 transitions. [2019-11-16 00:42:28,116 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 385 transitions. Word has length 25 [2019-11-16 00:42:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:28,116 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 385 transitions. [2019-11-16 00:42:28,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:42:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 385 transitions. [2019-11-16 00:42:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:42:28,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:28,118 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] [2019-11-16 00:42:28,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:28,322 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:28,323 INFO L82 PathProgramCache]: Analyzing trace with hash 611278406, now seen corresponding path program 1 times [2019-11-16 00:42:28,323 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:28,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1840940653] [2019-11-16 00:42:28,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:28,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:42:28,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:28,432 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-16 00:42:28,432 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:28,434 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-16 00:42:28,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1840940653] [2019-11-16 00:42:28,435 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:28,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-16 00:42:28,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90503762] [2019-11-16 00:42:28,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:28,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:28,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:28,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:28,436 INFO L87 Difference]: Start difference. First operand 271 states and 385 transitions. Second operand 6 states. [2019-11-16 00:42:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:28,617 INFO L93 Difference]: Finished difference Result 369 states and 510 transitions. [2019-11-16 00:42:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:42:28,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-16 00:42:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:28,620 INFO L225 Difference]: With dead ends: 369 [2019-11-16 00:42:28,620 INFO L226 Difference]: Without dead ends: 306 [2019-11-16 00:42:28,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:42:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-16 00:42:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 253. [2019-11-16 00:42:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-16 00:42:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 357 transitions. [2019-11-16 00:42:28,635 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 357 transitions. Word has length 25 [2019-11-16 00:42:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:28,636 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 357 transitions. [2019-11-16 00:42:28,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 357 transitions. [2019-11-16 00:42:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:42:28,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:28,637 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] [2019-11-16 00:42:28,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:28,839 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash 501595191, now seen corresponding path program 1 times [2019-11-16 00:42:28,840 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:28,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [993119896] [2019-11-16 00:42:28,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:28,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:42:28,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:28,927 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-16 00:42:28,927 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:28,982 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-16 00:42:28,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [993119896] [2019-11-16 00:42:28,983 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:28,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-16 00:42:28,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279307716] [2019-11-16 00:42:28,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:42:28,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:42:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:42:28,984 INFO L87 Difference]: Start difference. First operand 253 states and 357 transitions. Second operand 10 states. [2019-11-16 00:42:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:29,527 INFO L93 Difference]: Finished difference Result 494 states and 685 transitions. [2019-11-16 00:42:29,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:42:29,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-16 00:42:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:29,530 INFO L225 Difference]: With dead ends: 494 [2019-11-16 00:42:29,531 INFO L226 Difference]: Without dead ends: 431 [2019-11-16 00:42:29,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:42:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-16 00:42:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 261. [2019-11-16 00:42:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-16 00:42:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 369 transitions. [2019-11-16 00:42:29,547 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 369 transitions. Word has length 29 [2019-11-16 00:42:29,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:29,550 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 369 transitions. [2019-11-16 00:42:29,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:42:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 369 transitions. [2019-11-16 00:42:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:42:29,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:29,554 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] [2019-11-16 00:42:29,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:29,754 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash 503442233, now seen corresponding path program 1 times [2019-11-16 00:42:29,755 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:29,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2119010477] [2019-11-16 00:42:29,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:29,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:42:29,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:29,846 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-16 00:42:29,847 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:29,868 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-16 00:42:29,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2119010477] [2019-11-16 00:42:29,869 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:29,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:29,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453388344] [2019-11-16 00:42:29,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:29,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:29,870 INFO L87 Difference]: Start difference. First operand 261 states and 369 transitions. Second operand 6 states. [2019-11-16 00:42:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:29,944 INFO L93 Difference]: Finished difference Result 496 states and 688 transitions. [2019-11-16 00:42:29,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:29,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-16 00:42:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:29,947 INFO L225 Difference]: With dead ends: 496 [2019-11-16 00:42:29,947 INFO L226 Difference]: Without dead ends: 409 [2019-11-16 00:42:29,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-11-16 00:42:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 335. [2019-11-16 00:42:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-16 00:42:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 461 transitions. [2019-11-16 00:42:29,973 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 461 transitions. Word has length 29 [2019-11-16 00:42:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:29,974 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 461 transitions. [2019-11-16 00:42:29,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 461 transitions. [2019-11-16 00:42:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:42:29,975 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:29,975 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] [2019-11-16 00:42:30,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:30,178 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:30,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:30,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1737423153, now seen corresponding path program 1 times [2019-11-16 00:42:30,178 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:30,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [384703627] [2019-11-16 00:42:30,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:30,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:42:30,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:30,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:30,317 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-16 00:42:30,317 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:30,348 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-16 00:42:30,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [384703627] [2019-11-16 00:42:30,348 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:30,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:30,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668094887] [2019-11-16 00:42:30,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:30,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:30,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:30,350 INFO L87 Difference]: Start difference. First operand 335 states and 461 transitions. Second operand 6 states. [2019-11-16 00:42:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:30,537 INFO L93 Difference]: Finished difference Result 524 states and 719 transitions. [2019-11-16 00:42:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:42:30,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-16 00:42:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:30,541 INFO L225 Difference]: With dead ends: 524 [2019-11-16 00:42:30,541 INFO L226 Difference]: Without dead ends: 522 [2019-11-16 00:42:30,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:42:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-16 00:42:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 333. [2019-11-16 00:42:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-16 00:42:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 454 transitions. [2019-11-16 00:42:30,581 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 454 transitions. Word has length 29 [2019-11-16 00:42:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:30,581 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 454 transitions. [2019-11-16 00:42:30,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 454 transitions. [2019-11-16 00:42:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:42:30,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:30,583 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] [2019-11-16 00:42:30,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:30,794 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1508425246, now seen corresponding path program 1 times [2019-11-16 00:42:30,794 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:30,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2035122934] [2019-11-16 00:42:30,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:30,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:42:30,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:30,863 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-16 00:42:30,864 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:30,883 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-16 00:42:30,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2035122934] [2019-11-16 00:42:30,883 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:30,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:30,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660450247] [2019-11-16 00:42:30,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:30,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:30,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:30,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:30,885 INFO L87 Difference]: Start difference. First operand 333 states and 454 transitions. Second operand 6 states. [2019-11-16 00:42:30,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:30,985 INFO L93 Difference]: Finished difference Result 392 states and 528 transitions. [2019-11-16 00:42:30,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:30,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-16 00:42:30,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:30,988 INFO L225 Difference]: With dead ends: 392 [2019-11-16 00:42:30,988 INFO L226 Difference]: Without dead ends: 387 [2019-11-16 00:42:30,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-16 00:42:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 333. [2019-11-16 00:42:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-16 00:42:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2019-11-16 00:42:31,013 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 30 [2019-11-16 00:42:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:31,013 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2019-11-16 00:42:31,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2019-11-16 00:42:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-16 00:42:31,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:31,015 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] [2019-11-16 00:42:31,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:31,217 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:31,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:31,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1775795376, now seen corresponding path program 1 times [2019-11-16 00:42:31,217 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:31,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [435787549] [2019-11-16 00:42:31,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:31,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:42:31,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:31,319 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-16 00:42:31,319 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:31,333 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-16 00:42:31,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [435787549] [2019-11-16 00:42:31,333 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:31,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:31,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625855781] [2019-11-16 00:42:31,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:31,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:31,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:31,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:31,334 INFO L87 Difference]: Start difference. First operand 333 states and 451 transitions. Second operand 6 states. [2019-11-16 00:42:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:31,413 INFO L93 Difference]: Finished difference Result 621 states and 822 transitions. [2019-11-16 00:42:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:31,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-16 00:42:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:31,417 INFO L225 Difference]: With dead ends: 621 [2019-11-16 00:42:31,417 INFO L226 Difference]: Without dead ends: 551 [2019-11-16 00:42:31,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-11-16 00:42:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 340. [2019-11-16 00:42:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-16 00:42:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 461 transitions. [2019-11-16 00:42:31,454 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 461 transitions. Word has length 33 [2019-11-16 00:42:31,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:31,455 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 461 transitions. [2019-11-16 00:42:31,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:31,455 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 461 transitions. [2019-11-16 00:42:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:42:31,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:31,457 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] [2019-11-16 00:42:31,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:31,664 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash 51304021, now seen corresponding path program 1 times [2019-11-16 00:42:31,664 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:31,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2106170759] [2019-11-16 00:42:31,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:31,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:42:31,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:31,731 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-16 00:42:31,731 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:31,734 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-16 00:42:31,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2106170759] [2019-11-16 00:42:31,734 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:31,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-16 00:42:31,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177286338] [2019-11-16 00:42:31,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:31,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:31,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:31,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:31,735 INFO L87 Difference]: Start difference. First operand 340 states and 461 transitions. Second operand 4 states. [2019-11-16 00:42:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:31,783 INFO L93 Difference]: Finished difference Result 350 states and 472 transitions. [2019-11-16 00:42:31,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:31,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-16 00:42:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:31,785 INFO L225 Difference]: With dead ends: 350 [2019-11-16 00:42:31,786 INFO L226 Difference]: Without dead ends: 262 [2019-11-16 00:42:31,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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-16 00:42:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-16 00:42:31,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2019-11-16 00:42:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-16 00:42:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 346 transitions. [2019-11-16 00:42:31,805 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 346 transitions. Word has length 34 [2019-11-16 00:42:31,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:31,806 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 346 transitions. [2019-11-16 00:42:31,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 346 transitions. [2019-11-16 00:42:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:42:31,807 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:31,807 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] [2019-11-16 00:42:32,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:32,013 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2082740230, now seen corresponding path program 1 times [2019-11-16 00:42:32,013 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:32,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [612908255] [2019-11-16 00:42:32,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:32,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:32,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:34,222 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 17 [2019-11-16 00:42:34,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:34,352 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-16 00:42:34,352 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:34,565 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-16 00:42:34,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [612908255] [2019-11-16 00:42:34,565 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:34,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-16 00:42:34,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773766121] [2019-11-16 00:42:34,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:42:34,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:34,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:42:34,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:42:34,567 INFO L87 Difference]: Start difference. First operand 259 states and 346 transitions. Second operand 12 states. [2019-11-16 00:42:43,222 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-16 00:42:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:50,828 INFO L93 Difference]: Finished difference Result 461 states and 606 transitions. [2019-11-16 00:42:50,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:42:50,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-11-16 00:42:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:50,832 INFO L225 Difference]: With dead ends: 461 [2019-11-16 00:42:50,832 INFO L226 Difference]: Without dead ends: 459 [2019-11-16 00:42:50,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=105, Invalid=234, Unknown=3, NotChecked=0, Total=342 [2019-11-16 00:42:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-16 00:42:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 257. [2019-11-16 00:42:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:42:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 341 transitions. [2019-11-16 00:42:50,853 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 341 transitions. Word has length 34 [2019-11-16 00:42:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:50,855 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 341 transitions. [2019-11-16 00:42:50,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:42:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 341 transitions. [2019-11-16 00:42:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:42:50,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:50,856 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] [2019-11-16 00:42:51,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:51,059 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:51,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash 354754815, now seen corresponding path program 1 times [2019-11-16 00:42:51,060 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:51,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1350533647] [2019-11-16 00:42:51,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:51,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:42:51,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:51,183 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-16 00:42:51,183 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:51,216 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-16 00:42:51,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1350533647] [2019-11-16 00:42:51,217 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:51,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-16 00:42:51,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402344956] [2019-11-16 00:42:51,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:42:51,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:51,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:42:51,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:51,218 INFO L87 Difference]: Start difference. First operand 257 states and 341 transitions. Second operand 8 states. [2019-11-16 00:42:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:51,523 INFO L93 Difference]: Finished difference Result 402 states and 516 transitions. [2019-11-16 00:42:51,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:42:51,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-11-16 00:42:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:51,526 INFO L225 Difference]: With dead ends: 402 [2019-11-16 00:42:51,526 INFO L226 Difference]: Without dead ends: 359 [2019-11-16 00:42:51,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:42:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-16 00:42:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 257. [2019-11-16 00:42:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:42:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 340 transitions. [2019-11-16 00:42:51,546 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 340 transitions. Word has length 35 [2019-11-16 00:42:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:51,546 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 340 transitions. [2019-11-16 00:42:51,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:42:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 340 transitions. [2019-11-16 00:42:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:42:51,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:51,548 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] [2019-11-16 00:42:51,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:51,752 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1156444680, now seen corresponding path program 1 times [2019-11-16 00:42:51,752 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:51,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1893827109] [2019-11-16 00:42:51,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:51,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:42:51,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:51,893 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-16 00:42:51,894 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:51,996 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-16 00:42:51,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1893827109] [2019-11-16 00:42:51,996 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:51,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-16 00:42:51,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251413600] [2019-11-16 00:42:51,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:42:51,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:42:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:42:51,997 INFO L87 Difference]: Start difference. First operand 257 states and 340 transitions. Second operand 12 states. [2019-11-16 00:42:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:53,357 INFO L93 Difference]: Finished difference Result 650 states and 829 transitions. [2019-11-16 00:42:53,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:42:53,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-16 00:42:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:53,361 INFO L225 Difference]: With dead ends: 650 [2019-11-16 00:42:53,361 INFO L226 Difference]: Without dead ends: 623 [2019-11-16 00:42:53,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:42:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-11-16 00:42:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 336. [2019-11-16 00:42:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-16 00:42:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 441 transitions. [2019-11-16 00:42:53,398 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 441 transitions. Word has length 36 [2019-11-16 00:42:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:53,398 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 441 transitions. [2019-11-16 00:42:53,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:42:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 441 transitions. [2019-11-16 00:42:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:42:53,399 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:53,400 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] [2019-11-16 00:42:53,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:53,602 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1928546137, now seen corresponding path program 1 times [2019-11-16 00:42:53,603 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:53,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1948759002] [2019-11-16 00:42:53,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:53,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:42:53,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:53,689 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-16 00:42:53,689 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:53,708 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-16 00:42:53,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1948759002] [2019-11-16 00:42:53,709 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:53,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:53,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205970959] [2019-11-16 00:42:53,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:53,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:53,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:53,710 INFO L87 Difference]: Start difference. First operand 336 states and 441 transitions. Second operand 6 states. [2019-11-16 00:42:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:53,874 INFO L93 Difference]: Finished difference Result 473 states and 595 transitions. [2019-11-16 00:42:53,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:42:53,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-16 00:42:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:53,878 INFO L225 Difference]: With dead ends: 473 [2019-11-16 00:42:53,878 INFO L226 Difference]: Without dead ends: 455 [2019-11-16 00:42:53,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-16 00:42:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 336. [2019-11-16 00:42:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-16 00:42:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 440 transitions. [2019-11-16 00:42:53,916 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 440 transitions. Word has length 37 [2019-11-16 00:42:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:53,917 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 440 transitions. [2019-11-16 00:42:53,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 440 transitions. [2019-11-16 00:42:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:42:53,918 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:53,919 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] [2019-11-16 00:42:54,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:54,121 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:54,122 INFO L82 PathProgramCache]: Analyzing trace with hash 485252236, now seen corresponding path program 1 times [2019-11-16 00:42:54,123 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:54,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [160760550] [2019-11-16 00:42:54,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:54,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:42:54,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:54,220 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-16 00:42:54,220 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:54,223 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-16 00:42:54,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [160760550] [2019-11-16 00:42:54,223 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:54,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-16 00:42:54,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009366441] [2019-11-16 00:42:54,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:54,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:54,226 INFO L87 Difference]: Start difference. First operand 336 states and 440 transitions. Second operand 4 states. [2019-11-16 00:42:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:54,281 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2019-11-16 00:42:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:54,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-16 00:42:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:54,284 INFO L225 Difference]: With dead ends: 342 [2019-11-16 00:42:54,284 INFO L226 Difference]: Without dead ends: 266 [2019-11-16 00:42:54,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-16 00:42:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-16 00:42:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 247. [2019-11-16 00:42:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-16 00:42:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 322 transitions. [2019-11-16 00:42:54,309 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 322 transitions. Word has length 38 [2019-11-16 00:42:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:54,310 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 322 transitions. [2019-11-16 00:42:54,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 322 transitions. [2019-11-16 00:42:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:42:54,311 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:54,311 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] [2019-11-16 00:42:54,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:54,519 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:54,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1053866834, now seen corresponding path program 1 times [2019-11-16 00:42:54,520 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:54,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1135212040] [2019-11-16 00:42:54,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:54,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:54,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:54,628 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-16 00:42:54,628 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:54,787 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-16 00:42:54,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1135212040] [2019-11-16 00:42:54,787 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:54,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-16 00:42:54,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665198790] [2019-11-16 00:42:54,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:42:54,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:54,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:42:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:42:54,789 INFO L87 Difference]: Start difference. First operand 247 states and 322 transitions. Second operand 12 states. [2019-11-16 00:42:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:55,819 INFO L93 Difference]: Finished difference Result 544 states and 666 transitions. [2019-11-16 00:42:55,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:42:55,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-16 00:42:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:55,822 INFO L225 Difference]: With dead ends: 544 [2019-11-16 00:42:55,823 INFO L226 Difference]: Without dead ends: 495 [2019-11-16 00:42:55,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:42:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-16 00:42:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 257. [2019-11-16 00:42:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:42:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 334 transitions. [2019-11-16 00:42:55,849 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 334 transitions. Word has length 38 [2019-11-16 00:42:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:55,849 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 334 transitions. [2019-11-16 00:42:55,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:42:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 334 transitions. [2019-11-16 00:42:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-16 00:42:55,850 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:55,851 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] [2019-11-16 00:42:56,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:56,053 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:56,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:56,053 INFO L82 PathProgramCache]: Analyzing trace with hash -794681556, now seen corresponding path program 1 times [2019-11-16 00:42:56,054 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:56,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [190064314] [2019-11-16 00:42:56,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:56,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:42:56,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:56,179 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-16 00:42:56,179 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:56,205 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-16 00:42:56,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [190064314] [2019-11-16 00:42:56,205 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:56,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-16 00:42:56,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336245332] [2019-11-16 00:42:56,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:42:56,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:42:56,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:56,207 INFO L87 Difference]: Start difference. First operand 257 states and 334 transitions. Second operand 8 states. [2019-11-16 00:42:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:56,339 INFO L93 Difference]: Finished difference Result 287 states and 362 transitions. [2019-11-16 00:42:56,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:42:56,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-16 00:42:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:56,340 INFO L225 Difference]: With dead ends: 287 [2019-11-16 00:42:56,340 INFO L226 Difference]: Without dead ends: 285 [2019-11-16 00:42:56,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:42:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-16 00:42:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 257. [2019-11-16 00:42:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:42:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 329 transitions. [2019-11-16 00:42:56,365 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 329 transitions. Word has length 40 [2019-11-16 00:42:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:56,366 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 329 transitions. [2019-11-16 00:42:56,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:42:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 329 transitions. [2019-11-16 00:42:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:42:56,367 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:56,367 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] [2019-11-16 00:42:56,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:56,569 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:56,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:56,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1171807129, now seen corresponding path program 1 times [2019-11-16 00:42:56,570 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:56,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2111074104] [2019-11-16 00:42:56,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:56,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:42:56,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:57,591 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-16 00:42:57,592 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:58,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:58,897 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-16 00:42:58,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2111074104] [2019-11-16 00:42:58,898 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:58,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-11-16 00:42:58,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656945403] [2019-11-16 00:42:58,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:42:58,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:58,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:42:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:42:58,910 INFO L87 Difference]: Start difference. First operand 257 states and 329 transitions. Second operand 22 states. [2019-11-16 00:42:59,624 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-16 00:43:00,583 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-16 00:43:01,320 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-16 00:43:02,172 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-16 00:43:02,591 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-16 00:43:03,617 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-16 00:43:04,686 WARN L191 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-16 00:43:05,645 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-16 00:43:08,923 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-11-16 00:43:09,369 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-11-16 00:43:09,652 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-16 00:43:10,024 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-11-16 00:43:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:10,188 INFO L93 Difference]: Finished difference Result 596 states and 718 transitions. [2019-11-16 00:43:10,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-16 00:43:10,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-11-16 00:43:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:10,195 INFO L225 Difference]: With dead ends: 596 [2019-11-16 00:43:10,195 INFO L226 Difference]: Without dead ends: 558 [2019-11-16 00:43:10,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=574, Invalid=2848, Unknown=0, NotChecked=0, Total=3422 [2019-11-16 00:43:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-11-16 00:43:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 306. [2019-11-16 00:43:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-16 00:43:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 387 transitions. [2019-11-16 00:43:10,234 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 387 transitions. Word has length 42 [2019-11-16 00:43:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:10,235 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 387 transitions. [2019-11-16 00:43:10,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:43:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 387 transitions. [2019-11-16 00:43:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:43:10,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:10,236 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-16 00:43:10,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:10,438 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:10,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash 967666444, now seen corresponding path program 1 times [2019-11-16 00:43:10,439 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:10,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [26243580] [2019-11-16 00:43:10,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:10,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:43:10,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:10,683 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-16 00:43:10,683 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:10,849 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-16 00:43:10,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [26243580] [2019-11-16 00:43:10,849 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:10,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-16 00:43:10,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956365443] [2019-11-16 00:43:10,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:43:10,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:10,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:43:10,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:43:10,850 INFO L87 Difference]: Start difference. First operand 306 states and 387 transitions. Second operand 14 states. [2019-11-16 00:43:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:12,830 INFO L93 Difference]: Finished difference Result 540 states and 648 transitions. [2019-11-16 00:43:12,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-16 00:43:12,831 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-11-16 00:43:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:12,833 INFO L225 Difference]: With dead ends: 540 [2019-11-16 00:43:12,833 INFO L226 Difference]: Without dead ends: 502 [2019-11-16 00:43:12,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:43:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-16 00:43:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 246. [2019-11-16 00:43:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-16 00:43:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 311 transitions. [2019-11-16 00:43:12,868 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 311 transitions. Word has length 43 [2019-11-16 00:43:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:12,868 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 311 transitions. [2019-11-16 00:43:12,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:43:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 311 transitions. [2019-11-16 00:43:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:43:12,870 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:12,870 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:13,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:13,072 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:13,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1590708502, now seen corresponding path program 1 times [2019-11-16 00:43:13,072 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:13,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2123278382] [2019-11-16 00:43:13,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:13,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:43:13,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:13,204 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-16 00:43:13,204 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:13,224 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-16 00:43:13,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2123278382] [2019-11-16 00:43:13,224 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:13,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-16 00:43:13,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381197506] [2019-11-16 00:43:13,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:43:13,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:13,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:43:13,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:43:13,225 INFO L87 Difference]: Start difference. First operand 246 states and 311 transitions. Second operand 8 states. [2019-11-16 00:43:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:13,383 INFO L93 Difference]: Finished difference Result 267 states and 331 transitions. [2019-11-16 00:43:13,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:43:13,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-16 00:43:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:13,384 INFO L225 Difference]: With dead ends: 267 [2019-11-16 00:43:13,384 INFO L226 Difference]: Without dead ends: 237 [2019-11-16 00:43:13,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:43:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-16 00:43:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2019-11-16 00:43:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-16 00:43:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 273 transitions. [2019-11-16 00:43:13,426 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 273 transitions. Word has length 45 [2019-11-16 00:43:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:13,426 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 273 transitions. [2019-11-16 00:43:13,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:43:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 273 transitions. [2019-11-16 00:43:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:43:13,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:13,427 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:13,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:13,629 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:13,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:13,629 INFO L82 PathProgramCache]: Analyzing trace with hash 828894207, now seen corresponding path program 1 times [2019-11-16 00:43:13,630 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:13,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1832708147] [2019-11-16 00:43:13,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:13,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:43:13,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:13,733 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-16 00:43:13,733 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:13,746 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-16 00:43:13,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1832708147] [2019-11-16 00:43:13,746 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:13,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:43:13,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763513880] [2019-11-16 00:43:13,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:43:13,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:13,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:43:13,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:43:13,747 INFO L87 Difference]: Start difference. First operand 217 states and 273 transitions. Second operand 6 states. [2019-11-16 00:43:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:13,807 INFO L93 Difference]: Finished difference Result 276 states and 336 transitions. [2019-11-16 00:43:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:43:13,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-16 00:43:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:13,809 INFO L225 Difference]: With dead ends: 276 [2019-11-16 00:43:13,810 INFO L226 Difference]: Without dead ends: 255 [2019-11-16 00:43:13,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:43:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-16 00:43:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 217. [2019-11-16 00:43:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-16 00:43:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 266 transitions. [2019-11-16 00:43:13,830 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 266 transitions. Word has length 47 [2019-11-16 00:43:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:13,831 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 266 transitions. [2019-11-16 00:43:13,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:43:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 266 transitions. [2019-11-16 00:43:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:43:13,832 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:13,832 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:14,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:14,033 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1468214233, now seen corresponding path program 1 times [2019-11-16 00:43:14,034 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:14,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1249357283] [2019-11-16 00:43:14,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:14,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:43:14,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:14,680 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-16 00:43:14,681 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:15,268 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-16 00:43:15,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1249357283] [2019-11-16 00:43:15,269 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:15,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-16 00:43:15,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715161498] [2019-11-16 00:43:15,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:43:15,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:43:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:43:15,270 INFO L87 Difference]: Start difference. First operand 217 states and 266 transitions. Second operand 20 states. [2019-11-16 00:43:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:28,111 INFO L93 Difference]: Finished difference Result 460 states and 517 transitions. [2019-11-16 00:43:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:43:28,112 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-11-16 00:43:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:28,113 INFO L225 Difference]: With dead ends: 460 [2019-11-16 00:43:28,113 INFO L226 Difference]: Without dead ends: 432 [2019-11-16 00:43:28,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=322, Invalid=1748, Unknown=0, NotChecked=0, Total=2070 [2019-11-16 00:43:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-16 00:43:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 226. [2019-11-16 00:43:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-16 00:43:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2019-11-16 00:43:28,152 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 47 [2019-11-16 00:43:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:28,152 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2019-11-16 00:43:28,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:43:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2019-11-16 00:43:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:43:28,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:28,154 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:28,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:28,356 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:28,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:28,356 INFO L82 PathProgramCache]: Analyzing trace with hash 319421117, now seen corresponding path program 1 times [2019-11-16 00:43:28,357 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:28,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1252887993] [2019-11-16 00:43:28,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:28,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:43:28,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:28,479 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-16 00:43:28,479 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:28,502 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-16 00:43:28,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1252887993] [2019-11-16 00:43:28,502 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:28,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-16 00:43:28,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626607117] [2019-11-16 00:43:28,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:43:28,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:43:28,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:43:28,503 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand 8 states. [2019-11-16 00:43:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:28,692 INFO L93 Difference]: Finished difference Result 370 states and 438 transitions. [2019-11-16 00:43:28,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:43:28,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-16 00:43:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:28,695 INFO L225 Difference]: With dead ends: 370 [2019-11-16 00:43:28,695 INFO L226 Difference]: Without dead ends: 318 [2019-11-16 00:43:28,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:43:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-16 00:43:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 224. [2019-11-16 00:43:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-16 00:43:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 274 transitions. [2019-11-16 00:43:28,743 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 274 transitions. Word has length 47 [2019-11-16 00:43:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:28,743 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 274 transitions. [2019-11-16 00:43:28,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:43:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 274 transitions. [2019-11-16 00:43:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:43:28,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:28,744 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:28,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:28,946 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:28,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash 783709332, now seen corresponding path program 1 times [2019-11-16 00:43:28,946 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:28,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1369942257] [2019-11-16 00:43:28,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:29,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:43:29,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:29,052 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-16 00:43:29,052 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:29,106 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-16 00:43:29,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1369942257] [2019-11-16 00:43:29,107 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:29,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-16 00:43:29,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908641990] [2019-11-16 00:43:29,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:43:29,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:43:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:43:29,108 INFO L87 Difference]: Start difference. First operand 224 states and 274 transitions. Second operand 7 states. [2019-11-16 00:43:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:29,338 INFO L93 Difference]: Finished difference Result 292 states and 342 transitions. [2019-11-16 00:43:29,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:43:29,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-11-16 00:43:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:29,340 INFO L225 Difference]: With dead ends: 292 [2019-11-16 00:43:29,340 INFO L226 Difference]: Without dead ends: 274 [2019-11-16 00:43:29,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:43:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-16 00:43:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 162. [2019-11-16 00:43:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-16 00:43:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2019-11-16 00:43:29,365 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 48 [2019-11-16 00:43:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:29,365 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2019-11-16 00:43:29,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:43:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2019-11-16 00:43:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:43:29,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:29,366 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:29,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:29,568 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:29,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1897706261, now seen corresponding path program 1 times [2019-11-16 00:43:29,568 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:29,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [408620733] [2019-11-16 00:43:29,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:29,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:43:29,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:29,641 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-16 00:43:29,641 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:29,643 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-16 00:43:29,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [408620733] [2019-11-16 00:43:29,643 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:29,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:43:29,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912641153] [2019-11-16 00:43:29,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:43:29,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:29,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:43:29,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:43:29,644 INFO L87 Difference]: Start difference. First operand 162 states and 203 transitions. Second operand 3 states. [2019-11-16 00:43:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:29,683 INFO L93 Difference]: Finished difference Result 247 states and 302 transitions. [2019-11-16 00:43:29,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:43:29,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-16 00:43:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:29,685 INFO L225 Difference]: With dead ends: 247 [2019-11-16 00:43:29,685 INFO L226 Difference]: Without dead ends: 87 [2019-11-16 00:43:29,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 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-16 00:43:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-16 00:43:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-16 00:43:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-16 00:43:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2019-11-16 00:43:29,697 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 48 [2019-11-16 00:43:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:29,697 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2019-11-16 00:43:29,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:43:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2019-11-16 00:43:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:43:29,698 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:29,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:29,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:29,900 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:29,900 INFO L82 PathProgramCache]: Analyzing trace with hash 994748235, now seen corresponding path program 1 times [2019-11-16 00:43:29,900 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:29,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [637170785] [2019-11-16 00:43:29,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:29,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:43:29,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:29,986 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-16 00:43:29,987 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:30,001 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-16 00:43:30,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [637170785] [2019-11-16 00:43:30,001 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:30,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:43:30,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071792548] [2019-11-16 00:43:30,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:43:30,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:43:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:43:30,002 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 7 states. [2019-11-16 00:43:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:30,038 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2019-11-16 00:43:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:43:30,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-11-16 00:43:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:30,039 INFO L225 Difference]: With dead ends: 103 [2019-11-16 00:43:30,039 INFO L226 Difference]: Without dead ends: 61 [2019-11-16 00:43:30,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:43:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-16 00:43:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-16 00:43:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-16 00:43:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-11-16 00:43:30,047 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 49 [2019-11-16 00:43:30,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:30,047 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-11-16 00:43:30,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:43:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-11-16 00:43:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:43:30,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:30,048 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:30,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:30,250 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1511004533, now seen corresponding path program 1 times [2019-11-16 00:43:30,250 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:30,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [485967104] [2019-11-16 00:43:30,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:30,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:43:30,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:30,341 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-16 00:43:30,342 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:30,357 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-16 00:43:30,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [485967104] [2019-11-16 00:43:30,358 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:30,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-16 00:43:30,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276651644] [2019-11-16 00:43:30,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:43:30,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:43:30,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:43:30,358 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 7 states. [2019-11-16 00:43:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:30,418 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-11-16 00:43:30,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:43:30,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-11-16 00:43:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:30,418 INFO L225 Difference]: With dead ends: 61 [2019-11-16 00:43:30,418 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:43:30,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:43:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:43:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:43:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:43:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:43:30,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-11-16 00:43:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:30,419 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:43:30,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:43:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:43:30,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:43:30,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:30,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:43:30,801 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 168 [2019-11-16 00:43:31,362 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 378 [2019-11-16 00:43:31,896 WARN L191 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 449 DAG size of output: 380 [2019-11-16 00:43:32,174 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 409 DAG size of output: 362 [2019-11-16 00:43:32,500 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 208 [2019-11-16 00:43:33,325 WARN L191 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 544 DAG size of output: 480 [2019-11-16 00:43:34,902 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 168 DAG size of output: 70 [2019-11-16 00:43:51,604 WARN L191 SmtUtils]: Spent 16.68 s on a formula simplification. DAG size of input: 372 DAG size of output: 163 [2019-11-16 00:44:11,352 WARN L191 SmtUtils]: Spent 19.74 s on a formula simplification. DAG size of input: 377 DAG size of output: 172 [2019-11-16 00:44:54,974 WARN L191 SmtUtils]: Spent 43.62 s on a formula simplification. DAG size of input: 358 DAG size of output: 185 [2019-11-16 00:44:59,236 WARN L191 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 202 DAG size of output: 51 [2019-11-16 00:46:12,572 WARN L191 SmtUtils]: Spent 1.22 m on a formula simplification. DAG size of input: 475 DAG size of output: 173 [2019-11-16 00:46:18,172 WARN L191 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 219 DAG size of output: 139 [2019-11-16 00:46:18,182 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 123) no Hoare annotation was computed. [2019-11-16 00:46:18,182 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-11-16 00:46:18,183 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 84 137) no Hoare annotation was computed. [2019-11-16 00:46:18,183 INFO L439 ceAbstractionStarter]: At program point L135(lines 84 137) the Hoare annotation is: (let ((.cse20 (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)))) (let ((.cse31 (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32))) (.cse29 (bvshl .cse20 (_ bv24 32)))) (let ((.cse17 (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) .cse29)) (.cse4 (not (bvult ULTIMATE.start_addflt_~a ULTIMATE.start_addflt_~b))) (.cse25 (= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0)) (.cse9 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~a~0)) (.cse26 (bvadd (bvneg (bvadd .cse31 (_ bv4294967168 32))) ULTIMATE.start_addflt_~ea~0))) (let ((.cse3 (bvult ULTIMATE.start_addflt_~b ULTIMATE.start_addflt_~a)) (.cse2 (not (bvsgt ULTIMATE.start_main_~sa~0 (_ bv0 32)))) (.cse22 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) .cse26)) (.cse24 (not (= (_ bv0 32) ULTIMATE.start_main_~a~0))) (.cse13 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~a~0)) (.cse0 (= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~b~0)) (.cse21 (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~__retres10~0)) (.cse1 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (.cse8 (= .cse20 .cse31)) (.cse5 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (.cse15 (exists ((ULTIMATE.start_main_~zero~0 (_ BitVec 32))) (bvugt ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~zero~0))) (.cse19 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0)) (.cse27 (and .cse4 .cse25 .cse9)) (.cse11 (not (bvult .cse17 ULTIMATE.start_main_~a~0)))) (or (and .cse0 .cse1 (and (not (= (_ bv0 32) ULTIMATE.start_addflt_~a)) (or (and .cse2 .cse3) (and .cse2 .cse4 .cse5)))) (and (= (_ bv1 32) ULTIMATE.start_main_~sb~0) (let ((.cse14 (let ((.cse23 (or .cse3 (and .cse4 .cse5)))) (or (and (not (= (_ bv0 32) ULTIMATE.start_addflt_~b)) .cse1 .cse23 .cse24) (and .cse19 .cse23 .cse24)))) (.cse12 (not (bvult ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0)))) (let ((.cse18 (or (and .cse21 (exists ((ULTIMATE.start_addflt_~a (_ BitVec 32))) (and (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (bvlshr ULTIMATE.start_addflt_~a (_ bv24 32))) (= (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) (bvadd (bvneg (bvadd (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32)) (_ bv4294967168 32))) ULTIMATE.start_addflt_~ea~0)))) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~a))) (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a))) .cse14 .cse5 (not (= (_ bv0 32) .cse22)) .cse13) (and .cse8 .cse14 .cse5 .cse15 .cse9 (or (not (= (_ bv0 32) (bvand (_ bv33554432 32) ULTIMATE.start_addflt_~ma~0))) .cse11) .cse12))) (.cse6 (= (_ bv1 32) ULTIMATE.start_main_~sa~0)) (.cse16 (not (bvult ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~b~0)))) (or (and .cse6 (let ((.cse7 (let ((.cse10 (or (and .cse14 .cse15 .cse9) (and (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a) .cse14 .cse15)))) (or (and .cse5 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse10 .cse13))))) (or (and (forall ((ULTIMATE.start_addflt_~ma~0 (_ BitVec 32))) (not (bvult (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) ULTIMATE.start_main_~a~0))) .cse7) (and .cse8 .cse9 .cse7))) .cse16 (not (bvult .cse17 ULTIMATE.start_main_~b~0))) (and .cse18 .cse19 .cse6) (and (= .cse20 (bvlshr ULTIMATE.start_main_~b~0 (_ bv24 32))) .cse18 .cse6 (exists ((ULTIMATE.start_addflt_~delta~0 (_ BitVec 32)) (ULTIMATE.start_addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~b)) ULTIMATE.start_addflt_~delta~0) (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~b~0)))))) .cse16)))) (= (bvadd ULTIMATE.start_main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~tmp___0~0)) (and .cse2 .cse4 .cse25 .cse9) (and (= ULTIMATE.start_addflt_~mb~0 .cse22) (exists ((ULTIMATE.start_addflt_~a (_ BitVec 32))) (and (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (bvlshr ULTIMATE.start_addflt_~a (_ bv24 32))) (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a) (= ULTIMATE.start_addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~a))))) .cse5 .cse24 .cse13 .cse0 .cse21 .cse1 (bvult .cse26 (_ bv32 32))) (and (not (bvsgt ULTIMATE.start_main_~sb~0 (_ bv0 32))) .cse27) (and .cse8 .cse5 (let ((.cse28 (bvadd ULTIMATE.start_addflt_~ma~0 ULTIMATE.start_addflt_~mb~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse28) .cse29) ULTIMATE.start_main_~a~0)) (not (= (_ bv0 32) (bvand (_ bv33554432 32) .cse28))))) .cse15 (let ((.cse30 (bvadd (bvlshr ULTIMATE.start_addflt_~mb~0 (bvadd (bvneg ULTIMATE.start_addflt_~eb~0) ULTIMATE.start_addflt_~ea~0)) ULTIMATE.start_addflt_~ma~0))) (or (not (= (_ bv0 32) (bvand (_ bv33554432 32) .cse30))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse30) .cse29) ULTIMATE.start_main_~a~0)))) (and .cse19 .cse27) .cse11)))))) [2019-11-16 00:46:18,183 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,183 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:46:18,184 INFO L443 ceAbstractionStarter]: For program point L284-1(lines 284 293) no Hoare annotation was computed. [2019-11-16 00:46:18,184 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 25) no Hoare annotation was computed. [2019-11-16 00:46:18,184 INFO L443 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-11-16 00:46:18,184 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 25) no Hoare annotation was computed. [2019-11-16 00:46:18,184 INFO L439 ceAbstractionStarter]: At program point L136(lines 74 138) the Hoare annotation is: (let ((.cse25 (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)))) (let ((.cse35 (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32))) (.cse31 (bvshl .cse25 (_ bv24 32)))) (let ((.cse24 (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) .cse31)) (.cse4 (not (bvult ULTIMATE.start_addflt_~a ULTIMATE.start_addflt_~b))) (.cse33 (= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0)) (.cse12 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~a~0)) (.cse34 (= |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~a~0)) (.cse29 (bvadd (bvneg (bvadd .cse35 (_ bv4294967168 32))) ULTIMATE.start_addflt_~ea~0))) (let ((.cse0 (= |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~b~0)) (.cse28 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) .cse29)) (.cse20 (not (= (_ bv0 32) ULTIMATE.start_main_~a~0))) (.cse14 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~a~0)) (.cse1 (= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~b~0)) (.cse27 (bvult ULTIMATE.start_main_~a~0 |ULTIMATE.start_addflt_#res|)) (.cse2 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (.cse8 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0)) (.cse6 (and .cse4 .cse33 .cse12 .cse34)) (.cse11 (= .cse25 .cse35)) (.cse5 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (.cse19 (exists ((ULTIMATE.start_main_~zero~0 (_ BitVec 32))) (bvugt ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~zero~0))) (.cse16 (not (bvult .cse24 ULTIMATE.start_main_~a~0))) (.cse3 (not (bvsgt ULTIMATE.start_main_~sa~0 (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 (and (not (= (_ bv0 32) ULTIMATE.start_addflt_~a)) (or (and .cse3 (bvult ULTIMATE.start_addflt_~b ULTIMATE.start_addflt_~a)) (and .cse3 .cse4 .cse5)))) (and (not (bvsgt ULTIMATE.start_main_~sb~0 (_ bv0 32))) .cse6) (and (= (_ bv1 32) ULTIMATE.start_main_~sb~0) (let ((.cse21 (not (= (_ bv0 32) ULTIMATE.start_addflt_~b))) (.cse15 (not (bvult |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~a~0))) (.cse17 (not (bvult ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0))) (.cse22 (not (bvult |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~b~0)))) (let ((.cse7 (let ((.cse26 (or (and .cse8 .cse22 .cse4 .cse20) (and .cse2 .cse22 .cse4 .cse20)))) (or (and .cse21 .cse26 .cse11 .cse5 .cse12 (or (not (= (_ bv0 32) (bvand (_ bv33554432 32) ULTIMATE.start_addflt_~ma~0))) .cse16) .cse15 .cse17) (and .cse26 (exists ((ULTIMATE.start_addflt_~a (_ BitVec 32))) (and (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (bvlshr ULTIMATE.start_addflt_~a (_ bv24 32))) (= (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) (bvadd (bvneg (bvadd (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32)) (_ bv4294967168 32))) ULTIMATE.start_addflt_~ea~0)))) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~a))) (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a))) .cse5 .cse14 (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~__retres10~0) .cse27 (not (= (_ bv0 32) .cse28)))))) (.cse9 (= (_ bv1 32) ULTIMATE.start_main_~sa~0)) (.cse23 (not (bvult ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~b~0)))) (or (and .cse7 .cse8 .cse9) (and (let ((.cse10 (let ((.cse13 (let ((.cse18 (or (and .cse8 .cse4 .cse20) (and .cse21 .cse2 .cse4 .cse20)))) (or (and .cse18 .cse19 .cse12) (and (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a) .cse18 .cse19))))) (or (and .cse5 .cse13 .cse14) (and .cse5 .cse13 .cse12 .cse15 .cse16 .cse17))))) (or (and (forall ((ULTIMATE.start_addflt_~ma~0 (_ BitVec 32))) (not (bvult (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) ULTIMATE.start_main_~a~0))) .cse10) (and .cse10 .cse11 .cse12))) .cse9 .cse22 .cse23 (not (bvult .cse24 ULTIMATE.start_main_~b~0))) (and (= .cse25 (bvlshr ULTIMATE.start_main_~b~0 (_ bv24 32))) .cse7 .cse9 (exists ((ULTIMATE.start_addflt_~delta~0 (_ BitVec 32)) (ULTIMATE.start_addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~b)) ULTIMATE.start_addflt_~delta~0) (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~b~0)))))) .cse23)))) (= (bvadd ULTIMATE.start_main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~tmp___0~0)) (and .cse0 (= ULTIMATE.start_addflt_~mb~0 .cse28) (exists ((ULTIMATE.start_addflt_~a (_ BitVec 32))) (and (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (bvlshr ULTIMATE.start_addflt_~a (_ bv24 32))) (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a) (= ULTIMATE.start_addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~a))))) .cse5 .cse20 .cse14 .cse1 .cse27 .cse2 (bvult .cse29 (_ bv32 32))) (and (and .cse8 .cse6) .cse11 .cse5 (let ((.cse30 (bvadd ULTIMATE.start_addflt_~ma~0 ULTIMATE.start_addflt_~mb~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse30) .cse31) ULTIMATE.start_main_~a~0)) (not (= (_ bv0 32) (bvand (_ bv33554432 32) .cse30))))) .cse19 (let ((.cse32 (bvadd (bvlshr ULTIMATE.start_addflt_~mb~0 (bvadd (bvneg ULTIMATE.start_addflt_~eb~0) ULTIMATE.start_addflt_~ea~0)) ULTIMATE.start_addflt_~ma~0))) (or (not (= (_ bv0 32) (bvand (_ bv33554432 32) .cse32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse32) .cse31) ULTIMATE.start_main_~a~0)))) .cse16) (and .cse3 .cse4 .cse33 .cse12 .cse34)))))) [2019-11-16 00:46:18,184 INFO L439 ceAbstractionStarter]: At program point L70(lines 19 72) the Hoare annotation is: (and (= (_ bv0 32) ULTIMATE.start_base2flt_~__retres4~0) (= ULTIMATE.start_base2flt_~m (_ bv0 32))) [2019-11-16 00:46:18,185 INFO L439 ceAbstractionStarter]: At program point L70-1(lines 19 72) the Hoare annotation is: (or (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_base2flt_~__retres4~0)) [2019-11-16 00:46:18,185 INFO L439 ceAbstractionStarter]: At program point L70-2(lines 19 72) the Hoare annotation is: (or (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_base2flt_~__retres4~0)) [2019-11-16 00:46:18,185 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 302) no Hoare annotation was computed. [2019-11-16 00:46:18,185 INFO L439 ceAbstractionStarter]: At program point L269-1(lines 240 346) the Hoare annotation is: (let ((.cse11 (= (_ bv0 32) ULTIMATE.start_addflt_~b)) (.cse10 (not (bvugt ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~a~0))) (.cse8 (not (bvult ULTIMATE.start_addflt_~a ULTIMATE.start_addflt_~b))) (.cse22 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))))) (let ((.cse7 (= (_ bv0 32) ULTIMATE.start_main_~a~0)) (.cse3 (and (and .cse10 .cse8) .cse22)) (.cse1 (not (bvult ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~a~0))) (.cse9 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~a~0)) (.cse0 (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a)) (.cse2 (not .cse11)) (.cse6 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (.cse4 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0)) (.cse12 (and (not (= (_ bv0 32) ULTIMATE.start_addflt_~a)) (or (bvult ULTIMATE.start_addflt_~b ULTIMATE.start_addflt_~a) (and .cse8 .cse22)))) (.cse13 (= ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~b~0))) (or (and .cse0 .cse1 (let ((.cse5 (not .cse7))) (or (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse5)))) (or (and (= ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~a~0) .cse8 (= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0) .cse9 (= |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~a~0)) (and .cse10 (and .cse7 .cse11))) (and .cse1 (and .cse3 .cse4) (exists ((ULTIMATE.start_main_~zero~0 (_ BitVec 32))) (bvugt ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~zero~0)) .cse9) (and .cse6 .cse12 .cse13) (and (= (_ bv1 32) ULTIMATE.start_main_~sb~0) (= (bvadd ULTIMATE.start_main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~tmp___0~0) (let ((.cse14 (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)))) (let ((.cse31 (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl .cse14 (_ bv24 32))))) (let ((.cse21 (forall ((ULTIMATE.start_addflt_~ma~0 (_ BitVec 32))) (not (bvult (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) ULTIMATE.start_main_~a~0)))) (.cse20 (or (forall ((ULTIMATE.start_addflt_~ma~0 (_ BitVec 32))) (not (bvult (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv129 32)) (_ bv24 32))) ULTIMATE.start_main_~a~0))) (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv4294967169 32)) (_ bv0 32)))) (.cse24 (not (bvult |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~a~0))) (.cse25 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~a~0)) (.cse28 (not (bvult .cse31 ULTIMATE.start_main_~a~0))) (.cse29 (not (bvult ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0))) (.cse26 (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~r_add~0)) (.cse18 (not (bvult ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~b~0))) (.cse30 (not (= (_ bv0 32) ULTIMATE.start_main_~sa~0)))) (let ((.cse16 (and (let ((.cse32 (let ((.cse33 (and (let ((.cse34 (and .cse2 (or (and .cse4 .cse12 .cse18) (and .cse6 .cse12 .cse18))))) (or (and .cse26 .cse34 .cse9) (and .cse26 .cse0 .cse34))) .cse22))) (or (and (exists ((ULTIMATE.start_addflt_~a (_ BitVec 32))) (and (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (bvlshr ULTIMATE.start_addflt_~a (_ bv24 32))) (= (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) (bvadd (bvneg (bvadd (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32)) (_ bv4294967168 32))) ULTIMATE.start_addflt_~ea~0)))) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~a))) (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a))) .cse33 .cse24 .cse25 .cse29) (and .cse33 .cse24 .cse25 .cse28 .cse29) (and .cse9 .cse33))))) (or (and .cse21 .cse32 .cse24 .cse29) (and .cse20 .cse32))) .cse30)) (.cse15 (not (bvult |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~b~0))) (.cse17 (not (bvult ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~b~0)))) (or (and (= .cse14 (bvlshr ULTIMATE.start_main_~b~0 (_ bv24 32))) .cse15 .cse16 (exists ((ULTIMATE.start_addflt_~delta~0 (_ BitVec 32)) (ULTIMATE.start_addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~b)) ULTIMATE.start_addflt_~delta~0) (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~b~0)))))) .cse17) (and .cse4 .cse16) (and .cse6 .cse18 .cse15 (and (let ((.cse19 (let ((.cse27 (and .cse2 (or (and .cse4 .cse12) (and .cse6 .cse12))))) (let ((.cse23 (or (and .cse0 .cse27) (and .cse27 .cse9)))) (or (and .cse1 .cse22 .cse23 .cse24 .cse25) (and (= (_ bv1 32) ULTIMATE.start_main_~tmp___1~0) (= (_ bv1 32) ULTIMATE.start_main_~tmp___2~0) (and .cse26 .cse27) .cse22 .cse9) (and .cse1 .cse22 .cse9 .cse23 .cse24 .cse28 .cse29)))))) (or (and .cse19 .cse20) (and .cse19 .cse21))) .cse30) .cse17 (not (bvult .cse31 ULTIMATE.start_main_~b~0))))))))) (and .cse4 .cse12 .cse13)))) [2019-11-16 00:46:18,185 INFO L439 ceAbstractionStarter]: At program point L71(lines 15 73) the Hoare annotation is: (and (= (_ bv0 32) ULTIMATE.start_base2flt_~__retres4~0) (= ULTIMATE.start_base2flt_~m (_ bv0 32)) (= |ULTIMATE.start_base2flt_#res| (_ bv0 32))) [2019-11-16 00:46:18,185 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-11-16 00:46:18,185 INFO L439 ceAbstractionStarter]: At program point L71-1(lines 15 73) the Hoare annotation is: (or (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) (and (= (_ bv0 32) ULTIMATE.start_base2flt_~__retres4~0) (= |ULTIMATE.start_base2flt_#res| (_ bv0 32)))) [2019-11-16 00:46:18,185 INFO L439 ceAbstractionStarter]: At program point L38-1(lines 28 43) the Hoare annotation is: false [2019-11-16 00:46:18,186 INFO L439 ceAbstractionStarter]: At program point L71-2(lines 15 73) the Hoare annotation is: (or (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) (and (= (_ bv0 32) ULTIMATE.start_base2flt_~__retres4~0) (= |ULTIMATE.start_base2flt_#res| (_ bv0 32)))) [2019-11-16 00:46:18,186 INFO L443 ceAbstractionStarter]: For program point L38-2(lines 38 42) no Hoare annotation was computed. [2019-11-16 00:46:18,186 INFO L439 ceAbstractionStarter]: At program point L38-3(lines 28 43) the Hoare annotation is: (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) [2019-11-16 00:46:18,186 INFO L443 ceAbstractionStarter]: For program point L38-4(lines 38 42) no Hoare annotation was computed. [2019-11-16 00:46:18,186 INFO L439 ceAbstractionStarter]: At program point L38-5(lines 28 43) the Hoare annotation is: (or (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~zero~0 (_ bv0 32))) [2019-11-16 00:46:18,186 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 299) no Hoare annotation was computed. [2019-11-16 00:46:18,186 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 291) no Hoare annotation was computed. [2019-11-16 00:46:18,186 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 287 291) no Hoare annotation was computed. [2019-11-16 00:46:18,186 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 280) no Hoare annotation was computed. [2019-11-16 00:46:18,186 INFO L443 ceAbstractionStarter]: For program point L271-2(lines 271 280) no Hoare annotation was computed. [2019-11-16 00:46:18,186 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 9) no Hoare annotation was computed. [2019-11-16 00:46:18,186 INFO L439 ceAbstractionStarter]: At program point L7-2(lines 6 11) the Hoare annotation is: (and (= (_ bv1 32) ULTIMATE.start_main_~sb~0) (= (bvadd ULTIMATE.start_main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (let ((.cse3 (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32))) (.cse0 (= (_ bv1 32) ULTIMATE.start_main_~sa~0)) (.cse1 (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)))) (or (and (and .cse0 .cse1 (exists ((ULTIMATE.start_main_~zero~0 (_ BitVec 32))) (bvugt ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~zero~0)) (exists ((ULTIMATE.start_addflt_~a (_ BitVec 32))) (= ULTIMATE.start_addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~a)))) (not (bvult ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_addflt_~b (_ BitVec 32))) (= ULTIMATE.start_addflt_~mb~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~b)))) (= .cse2 .cse3) (not (bvult (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl .cse2 (_ bv24 32))) ULTIMATE.start_main_~a~0))) (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~a~0)) (and (= ULTIMATE.start_addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~b~0))) (= (bvadd ULTIMATE.start_addflt_~eb~0 (_ bv128 32)) .cse3) .cse0 .cse1 (not (= (_ bv0 32) ULTIMATE.start_main_~a~0)) (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~a~0) (= .cse2 (bvlshr ULTIMATE.start_main_~b~0 (_ bv24 32))) (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a) (= (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) ULTIMATE.start_addflt_~mb~0) (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)))) (= (_ bv1 32) ULTIMATE.start_main_~tmp___0~0)) [2019-11-16 00:46:18,186 INFO L443 ceAbstractionStarter]: For program point L7-3(lines 7 9) no Hoare annotation was computed. [2019-11-16 00:46:18,187 INFO L439 ceAbstractionStarter]: At program point L7-5(lines 6 11) the Hoare annotation is: (and (= (_ bv1 32) ULTIMATE.start_main_~sb~0) (let ((.cse5 (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)))) (let ((.cse15 (bvshl .cse5 (_ bv24 32))) (.cse13 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~a~0)) (.cse1 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0))) (let ((.cse7 (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32))) (.cse8 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~a~0)) (.cse6 (let ((.cse17 (let ((.cse19 (and (bvult ULTIMATE.start_addflt_~ma~0 (_ bv33554432 32)) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvult ULTIMATE.start_addflt_~a ULTIMATE.start_addflt_~b)))) (.cse20 (not (= (_ bv0 32) ULTIMATE.start_main_~a~0)))) (or (and .cse1 .cse19 .cse20) (and (not (= (_ bv0 32) ULTIMATE.start_addflt_~b)) (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0) .cse19 .cse20)))) (.cse18 (exists ((ULTIMATE.start_main_~zero~0 (_ BitVec 32))) (bvugt ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~zero~0)))) (or (and (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a) .cse17 .cse18) (and .cse17 .cse18 .cse13)))) (.cse11 (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) .cse15))) (let ((.cse0 (let ((.cse12 (or (and .cse6 (let ((.cse14 (bvadd ULTIMATE.start_addflt_~ma~0 ULTIMATE.start_addflt_~mb~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse14) .cse15) ULTIMATE.start_main_~a~0)) (not (= (_ bv0 32) (bvand (_ bv33554432 32) .cse14))))) (let ((.cse16 (bvadd (bvlshr ULTIMATE.start_addflt_~mb~0 (bvadd (bvneg ULTIMATE.start_addflt_~eb~0) ULTIMATE.start_addflt_~ea~0)) ULTIMATE.start_addflt_~ma~0))) (or (not (= (_ bv0 32) (bvand (_ bv33554432 32) .cse16))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse16) .cse15) ULTIMATE.start_main_~a~0)))) .cse8) (and .cse6 .cse13 (not (bvult .cse11 ULTIMATE.start_main_~a~0)))))) (or (and (forall ((ULTIMATE.start_addflt_~ma~0 (_ BitVec 32))) (not (bvult (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) ULTIMATE.start_main_~a~0))) .cse12) (and (= .cse5 .cse7) .cse12 .cse13)))) (.cse2 (= (_ bv1 32) ULTIMATE.start_main_~sa~0)) (.cse3 (= (bvadd ULTIMATE.start_main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (not (bvult .cse11 ULTIMATE.start_main_~b~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (= .cse5 (bvlshr ULTIMATE.start_main_~b~0 (_ bv24 32))) (not (= (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~b~0)))) (_ bv0 32))) .cse2 .cse3 (and .cse6 (exists ((ULTIMATE.start_addflt_~a (_ BitVec 32))) (and (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (bvlshr ULTIMATE.start_addflt_~a (_ bv24 32))) (= (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) (bvadd (bvneg (bvadd (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32)) (_ bv4294967168 32))) ULTIMATE.start_addflt_~ea~0)))) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~a))) (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a))) (not (= (_ bv0 32) (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) (bvadd (bvneg (bvadd .cse7 (_ bv4294967168 32))) ULTIMATE.start_addflt_~ea~0)))) .cse8) (exists ((ULTIMATE.start_addflt_~delta~0 (_ BitVec 32)) (ULTIMATE.start_addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~b)) ULTIMATE.start_addflt_~delta~0) (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~b~0))))))) (and .cse0 .cse2 .cse3 (forall ((v_ULTIMATE.start_addflt_~delta~0_24 (_ BitVec 32))) (let ((.cse10 (bvlshr ULTIMATE.start_addflt_~mb~0 v_ULTIMATE.start_addflt_~delta~0_24))) (let ((.cse9 (bvadd ULTIMATE.start_addflt_~ma~0 .cse10))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse9) (bvshl (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) ULTIMATE.start_main_~b~0)) (not (= (_ bv0 32) (bvand (_ bv33554432 32) .cse9))) (= (_ bv0 32) .cse10))))) .cse4)))))) (= (_ bv1 32) ULTIMATE.start_main_~tmp___0~0)) [2019-11-16 00:46:18,187 INFO L443 ceAbstractionStarter]: For program point L7-6(lines 7 9) no Hoare annotation was computed. [2019-11-16 00:46:18,187 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 330) no Hoare annotation was computed. [2019-11-16 00:46:18,188 INFO L439 ceAbstractionStarter]: At program point L7-8(lines 284 293) the Hoare annotation is: (let ((.cse32 (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)))) (let ((.cse44 (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl .cse32 (_ bv24 32)))) (.cse43 (not (bvult ULTIMATE.start_addflt_~a ULTIMATE.start_addflt_~b))) (.cse31 (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32)))) (let ((.cse7 (= .cse32 .cse31)) (.cse10 (bvsge ULTIMATE.start_main_~tmp___2~0 (_ bv0 32))) (.cse14 (not (bvult ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~a~0))) (.cse18 (and (not (bvugt ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~a~0)) .cse43)) (.cse11 (bvsge ULTIMATE.start_main_~tmp___1~0 (_ bv0 32))) (.cse30 (bvult ULTIMATE.start_main_~a~0 |ULTIMATE.start_addflt_#res|)) (.cse0 (= (_ bv1 32) ULTIMATE.start_main_~sa~0)) (.cse1 (= (bvadd ULTIMATE.start_main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (not (bvult ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~b~0))) (.cse22 (not (bvult |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~b~0))) (.cse23 (not (bvult ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~b~0))) (.cse24 (not (bvult .cse44 ULTIMATE.start_main_~b~0))) (.cse4 (forall ((ULTIMATE.start_addflt_~ma~0 (_ BitVec 32))) (not (bvult (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) ULTIMATE.start_main_~a~0)))) (.cse29 (= (_ bv1 32) ULTIMATE.start_main_~tmp___1~0)) (.cse28 (= (_ bv1 32) ULTIMATE.start_main_~tmp___2~0)) (.cse12 (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (not (bvult |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~a~0))) (.cse13 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~a~0)) (.cse26 (not (bvult .cse44 ULTIMATE.start_main_~a~0))) (.cse6 (not (bvult ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0))) (.cse8 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~a~0)) (.cse16 (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a)) (.cse25 (exists ((ULTIMATE.start_main_~zero~0 (_ BitVec 32))) (bvugt ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~zero~0))) (.cse19 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0)) (.cse17 (not (= (_ bv0 32) ULTIMATE.start_addflt_~b))) (.cse21 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (.cse20 (not (= (_ bv0 32) ULTIMATE.start_main_~a~0)))) (or (and .cse0 .cse1 .cse2 (let ((.cse3 (let ((.cse9 (let ((.cse15 (or (and .cse17 .cse18 .cse19 .cse20) (and .cse17 .cse18 .cse21 .cse20)))) (or (and .cse14 .cse8 .cse15) (and .cse16 .cse14 .cse15))))) (or (and .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse9 .cse10 .cse11 .cse12 .cse8))))) (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse7 .cse8))) .cse22 .cse23 .cse24) (and .cse7 .cse8 (and .cse10 (and .cse14 (or (and .cse17 .cse18 .cse21) (and .cse18 .cse19)) .cse25) .cse11 .cse12 (or (not (= (_ bv0 32) (bvand (_ bv33554432 32) ULTIMATE.start_addflt_~ma~0))) .cse26)) .cse5 .cse6) (let ((.cse27 (bvadd (bvneg (bvadd .cse31 (_ bv4294967168 32))) ULTIMATE.start_addflt_~ea~0))) (and (= ULTIMATE.start_addflt_~mb~0 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) .cse27)) .cse28 .cse12 (exists ((ULTIMATE.start_addflt_~a (_ BitVec 32))) (and (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (bvlshr ULTIMATE.start_addflt_~a (_ bv24 32))) (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a) (= ULTIMATE.start_addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~a))))) (and (= |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~b~0) (= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~b~0) .cse21 (= ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~b~0) .cse20) .cse13 .cse29 .cse30 (bvult .cse27 (_ bv32 32)))) (and (= (_ bv1 32) ULTIMATE.start_main_~sb~0) (let ((.cse38 (or (forall ((ULTIMATE.start_addflt_~ma~0 (_ BitVec 32))) (not (bvult (bvor (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~ma~0) (bvshl (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv129 32)) (_ bv24 32))) ULTIMATE.start_main_~a~0))) (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv4294967169 32)) (_ bv0 32)))) (.cse34 (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~r_add~0)) (.cse36 (and (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) .cse43))) (let ((.cse39 (let ((.cse40 (let ((.cse41 (let ((.cse42 (or (and .cse19 .cse36 .cse20) (and .cse17 .cse36 .cse21 .cse20)))) (or (and .cse34 .cse42 .cse25 .cse8) (and .cse34 .cse16 .cse42 .cse25))))) (or (and .cse29 .cse28 .cse41 .cse12 .cse8) (and .cse29 .cse28 .cse41 .cse12 .cse5 .cse13 .cse26 .cse6))))) (or (and .cse38 .cse40) (and .cse4 .cse5 .cse40 .cse6))))) (or (and (= .cse32 (bvlshr ULTIMATE.start_main_~b~0 (_ bv24 32))) .cse0 .cse1 (and (let ((.cse33 (let ((.cse35 (let ((.cse37 (exists ((ULTIMATE.start_main_~zero~0 (_ BitVec 32))) (bvugt ULTIMATE.start_addflt_~a ULTIMATE.start_main_~zero~0)))) (or (and .cse19 .cse36 .cse2 .cse37 .cse22 .cse20 .cse23) (and .cse36 .cse21 .cse2 .cse37 .cse22 .cse20 .cse23))))) (or (and .cse34 .cse17 .cse8 .cse35) (and .cse34 .cse16 .cse17 (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~__retres10~0) .cse30 .cse35))))) (or (and .cse29 .cse28 (exists ((ULTIMATE.start_addflt_~a (_ BitVec 32))) (and (= (bvadd ULTIMATE.start_addflt_~ea~0 (_ bv128 32)) (bvlshr ULTIMATE.start_addflt_~a (_ bv24 32))) (= (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~a~0)) (bvadd (bvneg (bvadd (bvlshr ULTIMATE.start_main_~a~0 (_ bv24 32)) (_ bv4294967168 32))) ULTIMATE.start_addflt_~ea~0)))) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~a))) (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a))) .cse12 .cse33 .cse13) (and .cse29 .cse28 .cse12 .cse33 .cse8))) .cse38) (exists ((ULTIMATE.start_addflt_~delta~0 (_ BitVec 32)) (ULTIMATE.start_addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_addflt_~b)) ULTIMATE.start_addflt_~delta~0) (bvadd ULTIMATE.start_addflt_~ma~0 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) ULTIMATE.start_main_~b~0))))))) (and .cse19 .cse0 .cse1 .cse39) (and .cse0 .cse1 .cse2 .cse39 .cse22 .cse23 .cse24)))) (= (_ bv1 32) ULTIMATE.start_main_~tmp___0~0)))))) [2019-11-16 00:46:18,188 INFO L443 ceAbstractionStarter]: For program point L321-2(lines 320 336) no Hoare annotation was computed. [2019-11-16 00:46:18,188 INFO L443 ceAbstractionStarter]: For program point L7-9(lines 7 9) no Hoare annotation was computed. [2019-11-16 00:46:18,188 INFO L443 ceAbstractionStarter]: For program point L7-12(lines 7 9) no Hoare annotation was computed. [2019-11-16 00:46:18,188 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,188 INFO L443 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L8-3(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L8-4(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L256-1(lines 256 265) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 342) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L446 ceAbstractionStarter]: At program point L306-1(lines 306 342) the Hoare annotation is: true [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 66) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 26 66) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L26-2(lines 26 66) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L439 ceAbstractionStarter]: At program point L307(lines 303 343) the Hoare annotation is: (let ((.cse11 (= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0)) (.cse7 (= (_ bv0 32) ULTIMATE.start_addflt_~b)) (.cse0 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (.cse12 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (.cse6 (= (_ bv0 32) ULTIMATE.start_main_~a~0)) (.cse5 (not (bvugt ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~a~0))) (.cse3 (not (bvult ULTIMATE.start_addflt_~a ULTIMATE.start_addflt_~b)))) (let ((.cse8 (not (bvult ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~a~0))) (.cse9 (let ((.cse13 (and .cse5 .cse3)) (.cse14 (not .cse6))) (or (and .cse11 .cse13 .cse12 .cse14) (and (not .cse7) .cse13 .cse0 .cse12 .cse14)))) (.cse10 (exists ((ULTIMATE.start_main_~zero~0 (_ BitVec 32))) (bvugt ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~zero~0))) (.cse4 (= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~a~0)) (.cse1 (= ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~b~0)) (.cse2 (and (not (= (_ bv0 32) ULTIMATE.start_addflt_~a)) (or (bvult ULTIMATE.start_addflt_~b ULTIMATE.start_addflt_~a) (and .cse3 .cse12))))) (or (and .cse0 .cse1 .cse2) (or (and (= ULTIMATE.start_main_~r_add~0 ULTIMATE.start_main_~a~0) .cse3 (= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0) .cse4 (= |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~a~0)) (and .cse5 (and .cse6 .cse7))) (and (bvult ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a) .cse8 .cse9 .cse10) (and .cse8 .cse9 .cse10 .cse4) (and .cse11 .cse1 .cse2)))) [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 278) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 274 278) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-11-16 00:46:18,189 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 324 328) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point L308-1(lines 306 340) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 263) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point L259-2(lines 259 263) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point L29(lines 28 43) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 28 43) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point L29-2(lines 28 43) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 315) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,190 INFO L439 ceAbstractionStarter]: At program point L64(lines 26 66) the Hoare annotation is: false [2019-11-16 00:46:18,190 INFO L439 ceAbstractionStarter]: At program point L64-1(lines 26 66) the Hoare annotation is: (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) [2019-11-16 00:46:18,190 INFO L439 ceAbstractionStarter]: At program point L64-2(lines 26 66) the Hoare annotation is: (or (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~zero~0 (_ bv0 32))) [2019-11-16 00:46:18,191 INFO L446 ceAbstractionStarter]: At program point L345(lines 216 347) the Hoare annotation is: true [2019-11-16 00:46:18,191 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 255) no Hoare annotation was computed. [2019-11-16 00:46:18,191 INFO L443 ceAbstractionStarter]: For program point L246-2(lines 240 346) no Hoare annotation was computed. [2019-11-16 00:46:18,191 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-16 00:46:18,191 INFO L439 ceAbstractionStarter]: At program point L48-2(lines 48 63) the Hoare annotation is: false [2019-11-16 00:46:18,191 INFO L439 ceAbstractionStarter]: At program point L48-5(lines 48 63) the Hoare annotation is: (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) [2019-11-16 00:46:18,191 INFO L439 ceAbstractionStarter]: At program point L48-8(lines 48 63) the Hoare annotation is: (or (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~zero~0 (_ bv0 32))) [2019-11-16 00:46:18,191 INFO L443 ceAbstractionStarter]: For program point L49(lines 48 63) no Hoare annotation was computed. [2019-11-16 00:46:18,191 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 48 63) no Hoare annotation was computed. [2019-11-16 00:46:18,191 INFO L443 ceAbstractionStarter]: For program point L49-2(lines 48 63) no Hoare annotation was computed. [2019-11-16 00:46:18,191 INFO L443 ceAbstractionStarter]: For program point L50(lines 48 63) no Hoare annotation was computed. [2019-11-16 00:46:18,191 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 48 63) no Hoare annotation was computed. [2019-11-16 00:46:18,192 INFO L443 ceAbstractionStarter]: For program point L50-2(lines 48 63) no Hoare annotation was computed. [2019-11-16 00:46:18,192 INFO L443 ceAbstractionStarter]: For program point L331-1(lines 318 336) no Hoare annotation was computed. [2019-11-16 00:46:18,192 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 253) no Hoare annotation was computed. [2019-11-16 00:46:18,192 INFO L443 ceAbstractionStarter]: For program point L249-2(lines 249 253) no Hoare annotation was computed. [2019-11-16 00:46:18,192 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 128) no Hoare annotation was computed. [2019-11-16 00:46:18,192 INFO L443 ceAbstractionStarter]: For program point L117-2(lines 117 128) no Hoare annotation was computed. [2019-11-16 00:46:18,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:46:18 BoogieIcfgContainer [2019-11-16 00:46:18,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:46:18,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:46:18,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:46:18,350 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:46:18,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:23" (3/4) ... [2019-11-16 00:46:18,354 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:46:18,368 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-16 00:46:18,368 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-16 00:46:18,394 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0bv32 == __retres4 && m == 0bv32) && \result == 0bv32 [2019-11-16 00:46:18,395 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: zero == 0bv32 || (0bv32 == __retres4 && \result == 0bv32) [2019-11-16 00:46:18,396 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0bv32 == a || zero == 0bv32) || (0bv32 == __retres4 && \result == 0bv32) [2019-11-16 00:46:18,397 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((__retres10 == b && a == b) && !(0bv32 == a) && ((!~bvsgt32(sa, 0bv32) && ~bvult64(b, a)) || ((!~bvsgt32(sa, 0bv32) && !~bvult64(a, b)) && !(cond == 0bv32)))) || (((1bv32 == sb && (((((1bv32 == sa && (((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((!(cond == 0bv32) && a == a) && (((((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)) || ((!(cond == 0bv32) && (((((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && b == a))) || ((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && a == a) && (((((!(cond == 0bv32) && a == a) && (((((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)) || ((!(cond == 0bv32) && (((((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && b == a))))) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)) || ((((((((~bvult64(a, __retres10) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && !(cond == 0bv32)) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) && b == a) || ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && !(cond == 0bv32)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(__retres10, a))) && b == b) && 1bv32 == sa)) || ((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && ((((((~bvult64(a, __retres10) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && !(cond == 0bv32)) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) && b == a) || ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && !(cond == 0bv32)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(__retres10, a)))) && 1bv32 == sa) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))))) && !~bvult64(__retres10, b)))) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && 1bv32 == tmp___0)) || (((!~bvsgt32(sa, 0bv32) && !~bvult64(a, b)) && __retres10 == a) && a == a)) || ((((((((mb == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a)))) && !(cond == 0bv32)) && !(0bv32 == a)) && b == a) && __retres10 == b) && ~bvult64(a, __retres10)) && a == b) && ~bvult64(~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea), 32bv32))) || (!~bvsgt32(sb, 0bv32) && (!~bvult64(a, b) && __retres10 == a) && a == a)) || ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && !(cond == 0bv32)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == b && (!~bvult64(a, b) && __retres10 == a) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) [2019-11-16 00:46:18,397 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == b && __retres10 == b) && a == b) && !(0bv32 == a) && ((!~bvsgt32(sa, 0bv32) && ~bvult64(b, a)) || ((!~bvsgt32(sa, 0bv32) && !~bvult64(a, b)) && !(cond == 0bv32)))) || (!~bvsgt32(sb, 0bv32) && ((!~bvult64(a, b) && __retres10 == a) && a == a) && \result == a)) || (((1bv32 == sb && ((((((((((((!(0bv32 == b) && ((((b == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)) || (((a == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)))) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && !(cond == 0bv32)) && a == a) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || ((((((((((b == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)) || (((a == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && !(cond == 0bv32)) && b == a) && ~bvult64(a, __retres10)) && ~bvult64(a, \result)) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea))))) && b == b) && 1bv32 == sa) || (((((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((!(cond == 0bv32) && ((((((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && (((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && b == a) || (((((!(cond == 0bv32) && ((((((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && (((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && a == a) && !~bvult64(\result, a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) || (((((!(cond == 0bv32) && ((((((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && (((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && b == a) || (((((!(cond == 0bv32) && ((((((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && (((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && a == a) && !~bvult64(\result, a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && a == a)) && 1bv32 == sa) && !~bvult64(\result, b)) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b))) || ((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && ((((((((!(0bv32 == b) && ((((b == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)) || (((a == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)))) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && !(cond == 0bv32)) && a == a) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || ((((((((((b == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)) || (((a == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && !(cond == 0bv32)) && b == a) && ~bvult64(a, __retres10)) && ~bvult64(a, \result)) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))))) && 1bv32 == sa) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))))) && !~bvult64(__retres10, b)))) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && 1bv32 == tmp___0)) || (((((((((\result == b && mb == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea))) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a)))) && !(cond == 0bv32)) && !(0bv32 == a)) && b == a) && __retres10 == b) && ~bvult64(a, \result)) && a == b) && ~bvult64(~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea), 32bv32))) || (((((((b == b && ((!~bvult64(a, b) && __retres10 == a) && a == a) && \result == a) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && !(cond == 0bv32)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) || ((((!~bvsgt32(sa, 0bv32) && !~bvult64(a, b)) && __retres10 == a) && a == a) && \result == a) [2019-11-16 00:46:18,398 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && (!~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && (!~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && a == b) && !(0bv32 == a)))) || ((((r_add == a && !~bvult64(a, b)) && __retres10 == a) && a == a) && \result == a) || (!~bvugt32(r_add, a) && 0bv32 == a && 0bv32 == b)) || (((!~bvult64(r_add, a) && ((!~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && b == b) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && r_add == b)) || (((1bv32 == sb && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && 1bv32 == tmp___0) && ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && !~bvult64(\result, b)) && (((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((((\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(__retres10, a)) || ((((((((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) || (a == a && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || (((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32) && (((((((\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(__retres10, a)) || ((((((((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) || (a == a && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32))))) && !(0bv32 == sa)) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))))) && !~bvult64(__retres10, b)) || (b == b && (((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((((\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(__retres10, a)) || ((((((((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) || (a == a && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || (((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32) && (((((((\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(__retres10, a)) || ((((((((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) || (a == a && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32))))) && !(0bv32 == sa))) || (((((a == b && !~bvult64(r_add, b)) && !~bvult64(\result, b)) && ((((((((!~bvult64(r_add, a) && !(cond == 0bv32)) && ((~bvult64(a, a) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) || ((!(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && a == a))) && !~bvult64(\result, a)) && b == a) || ((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ~bvult64(a, r_add) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && !(cond == 0bv32)) && a == a)) || ((((((!~bvult64(r_add, a) && !(cond == 0bv32)) && a == a) && ((~bvult64(a, a) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) || ((!(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && a == a))) && !~bvult64(\result, a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) && ((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32)) || (((((((!~bvult64(r_add, a) && !(cond == 0bv32)) && ((~bvult64(a, a) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) || ((!(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && a == a))) && !~bvult64(\result, a)) && b == a) || ((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ~bvult64(a, r_add) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && !(cond == 0bv32)) && a == a)) || ((((((!~bvult64(r_add, a) && !(cond == 0bv32)) && a == a) && ((~bvult64(a, a) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) || ((!(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && a == a))) && !~bvult64(\result, a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) && (forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) && !(0bv32 == sa)) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b))))) || ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && r_add == b) [2019-11-16 00:46:18,398 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == b && r_add == b) && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || ((((r_add == a && !~bvult64(a, b)) && __retres10 == a) && a == a) && \result == a) || (!~bvugt32(r_add, a) && 0bv32 == a && 0bv32 == b)) || (((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((b == b && !~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && !(0bv32 == a)) || ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(cond == 0bv32)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0)))) || (((!~bvult64(r_add, a) && ((((b == b && !~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && !(0bv32 == a)) || ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(cond == 0bv32)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) || ((b == b && r_add == b) && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) [2019-11-16 00:46:18,399 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1bv32 == sb && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && ((((((((((1bv32 == sa && ~bvadd64(cond, 4294967295bv32) == 0bv32) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && (\exists ULTIMATE.start_addflt_~a : bv32 :: ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a)))) && !~bvult64(a, b)) && b == b) && (\exists ULTIMATE.start_addflt_~b : bv32 :: mb == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)))) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && a == a) || (((((((((ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, b)) && ~bvadd64(eb, 128bv32) == ~bvlshr64(a, 24bv32)) && 1bv32 == sa) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !(0bv32 == a)) && b == a) && ~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32)) && ~bvult64(a, a)) && ~bvor32(16777216bv32, ~bvand64(16777215bv32, a)) == mb) && a == b))) && 1bv32 == tmp___0 [2019-11-16 00:46:18,399 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1bv32 == sa && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && !~bvult64(r_add, b)) && ((((((((((((!~bvult64(r_add, a) && a == a) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) || ((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a))))) && ~bvsge32(tmp___2, 0bv32)) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && b == a) || (((((((!~bvult64(r_add, a) && a == a) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) || ((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a))))) && ~bvsge32(tmp___2, 0bv32)) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a)) && (forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || ((((((((((!~bvult64(r_add, a) && a == a) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) || ((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a))))) && ~bvsge32(tmp___2, 0bv32)) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && b == a) || (((((((!~bvult64(r_add, a) && a == a) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) || ((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a))))) && ~bvsge32(tmp___2, 0bv32)) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a)) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && a == a))) && !~bvult64(\result, b)) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)) || ((((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && a == a) && (((~bvsge32(tmp___2, 0bv32) && (!~bvult64(r_add, a) && (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) || ((!~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a))) || ((((((((mb == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)) && 1bv32 == tmp___2) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a)))) && (((\result == b && __retres10 == b) && a == b) && r_add == b) && !(0bv32 == a)) && b == a) && 1bv32 == tmp___1) && ~bvult64(a, \result)) && ~bvult64(~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea), 32bv32))) || ((1bv32 == sb && ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && ((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && ((((~bvult64(a, r_add) && !(0bv32 == b)) && a == a) && (((((((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)) || (((((((!(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)))) || (((((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b)) && ~bvult64(a, __retres10)) && ~bvult64(a, \result)) && (((((((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)) || (((((((!(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)))))) && b == a) || ((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && ((((~bvult64(a, r_add) && !(0bv32 == b)) && a == a) && (((((((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)) || (((((((!(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)))) || (((((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b)) && ~bvult64(a, __retres10)) && ~bvult64(a, \result)) && (((((((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)) || (((((((!(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)))))) && a == a)) && ((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32)) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))))) || (((b == b && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && ((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32) && (((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a) || (((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) || ((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(\result, a)) && (((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a) || (((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) && !~bvult64(__retres10, a))))) || ((((((1bv32 == sa && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && !~bvult64(r_add, b)) && ((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32) && (((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a) || (((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) || ((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(\result, a)) && (((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a) || (((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) && !~bvult64(__retres10, a)))) && !~bvult64(\result, b)) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)))) && 1bv32 == tmp___0) [2019-11-16 00:46:18,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == sb && (((((((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == a) || (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) || ((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && (((((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == a) || (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) && a == a)) && b == b) && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)) || (((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && !(~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))) == 0bv32)) && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) && b == a) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b))))))) || (((((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == a) || (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) || ((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && (((((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == a) || (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) && a == a)) && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && (forall v_ULTIMATE.start_addflt_~delta~0_24 : bv32 :: (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, ~bvlshr64(mb, v_ULTIMATE.start_addflt_~delta~0_24))), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, ~bvlshr64(mb, v_ULTIMATE.start_addflt_~delta~0_24))))) || 0bv32 == ~bvlshr64(mb, v_ULTIMATE.start_addflt_~delta~0_24))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)))) && 1bv32 == tmp___0 [2019-11-16 00:46:18,432 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_954beac3-09a1-42c3-a11a-7b8f3bcc2aba/bin/uautomizer/witness.graphml [2019-11-16 00:46:18,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:46:18,433 INFO L168 Benchmark]: Toolchain (without parser) took 236688.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 952.3 MB in the beginning and 947.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 352.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:18,434 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:46:18,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:18,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.06 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-16 00:46:18,435 INFO L168 Benchmark]: Boogie Preprocessor took 69.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:18,435 INFO L168 Benchmark]: RCFGBuilder took 689.03 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: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:18,435 INFO L168 Benchmark]: TraceAbstraction took 235314.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 957.9 MB in the end (delta: 151.2 MB). Peak memory consumption was 509.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:18,436 INFO L168 Benchmark]: Witness Printer took 82.85 ms. Allocated memory is still 1.4 GB. Free memory was 957.9 MB in the beginning and 947.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:46:18,438 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 448.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.06 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 69.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 689.03 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: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 235314.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 957.9 MB in the end (delta: 151.2 MB). Peak memory consumption was 509.8 MB. Max. memory is 11.5 GB. * Witness Printer took 82.85 ms. Allocated memory is still 1.4 GB. Free memory was 957.9 MB in the beginning and 947.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 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[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: zero == 0bv32 || 0bv32 == __retres4 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (0bv32 == a || zero == 0bv32) || (0bv32 == __retres4 && \result == 0bv32) - InvariantResult [Line: 6]: Loop Invariant [2019-11-16 00:46:18,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] Derived loop invariant: ((1bv32 == sb && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && ((((((((((1bv32 == sa && ~bvadd64(cond, 4294967295bv32) == 0bv32) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && (\exists ULTIMATE.start_addflt_~a : bv32 :: ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a)))) && !~bvult64(a, b)) && b == b) && (\exists ULTIMATE.start_addflt_~b : bv32 :: mb == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)))) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && a == a) || (((((((((ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, b)) && ~bvadd64(eb, 128bv32) == ~bvlshr64(a, 24bv32)) && 1bv32 == sa) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !(0bv32 == a)) && b == a) && ~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32)) && ~bvult64(a, a)) && ~bvor32(16777216bv32, ~bvand64(16777215bv32, a)) == mb) && a == b))) && 1bv32 == tmp___0 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0bv32 == __retres4 && m == 0bv32 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: zero == 0bv32 || (0bv32 == __retres4 && \result == 0bv32) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (0bv32 == __retres4 && m == 0bv32) && \result == 0bv32 - InvariantResult [Line: 84]: Loop Invariant [2019-11-16 00:46:18,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] Derived loop invariant: ((((((__retres10 == b && a == b) && !(0bv32 == a) && ((!~bvsgt32(sa, 0bv32) && ~bvult64(b, a)) || ((!~bvsgt32(sa, 0bv32) && !~bvult64(a, b)) && !(cond == 0bv32)))) || (((1bv32 == sb && (((((1bv32 == sa && (((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((!(cond == 0bv32) && a == a) && (((((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)) || ((!(cond == 0bv32) && (((((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && b == a))) || ((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && a == a) && (((((!(cond == 0bv32) && a == a) && (((((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)) || ((!(cond == 0bv32) && (((((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && b == a))))) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)) || ((((((((~bvult64(a, __retres10) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && !(cond == 0bv32)) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) && b == a) || ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && !(cond == 0bv32)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(__retres10, a))) && b == b) && 1bv32 == sa)) || ((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && ((((((~bvult64(a, __retres10) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && !(cond == 0bv32)) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) && b == a) || ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && ((((!(0bv32 == b) && a == b) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)) || ((b == b && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !(0bv32 == a)))) && !(cond == 0bv32)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(__retres10, a)))) && 1bv32 == sa) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))))) && !~bvult64(__retres10, b)))) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && 1bv32 == tmp___0)) || (((!~bvsgt32(sa, 0bv32) && !~bvult64(a, b)) && __retres10 == a) && a == a)) || ((((((((mb == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a)))) && !(cond == 0bv32)) && !(0bv32 == a)) && b == a) && __retres10 == b) && ~bvult64(a, __retres10)) && a == b) && ~bvult64(~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea), 32bv32))) || (!~bvsgt32(sb, 0bv32) && (!~bvult64(a, b) && __retres10 == a) && a == a)) || ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && !(cond == 0bv32)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == b && (!~bvult64(a, b) && __retres10 == a) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) - InvariantResult [Line: 74]: Loop Invariant [2019-11-16 00:46:18,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] Derived loop invariant: (((((((\result == b && __retres10 == b) && a == b) && !(0bv32 == a) && ((!~bvsgt32(sa, 0bv32) && ~bvult64(b, a)) || ((!~bvsgt32(sa, 0bv32) && !~bvult64(a, b)) && !(cond == 0bv32)))) || (!~bvsgt32(sb, 0bv32) && ((!~bvult64(a, b) && __retres10 == a) && a == a) && \result == a)) || (((1bv32 == sb && ((((((((((((!(0bv32 == b) && ((((b == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)) || (((a == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)))) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && !(cond == 0bv32)) && a == a) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || ((((((((((b == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)) || (((a == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && !(cond == 0bv32)) && b == a) && ~bvult64(a, __retres10)) && ~bvult64(a, \result)) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea))))) && b == b) && 1bv32 == sa) || (((((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((!(cond == 0bv32) && ((((((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && (((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && b == a) || (((((!(cond == 0bv32) && ((((((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && (((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && a == a) && !~bvult64(\result, a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) || (((((!(cond == 0bv32) && ((((((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && (((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && b == a) || (((((!(cond == 0bv32) && ((((((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || ((~bvult64(a, a) && (((b == b && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && a == a) && !~bvult64(\result, a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && a == a)) && 1bv32 == sa) && !~bvult64(\result, b)) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b))) || ((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && ((((((((!(0bv32 == b) && ((((b == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)) || (((a == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)))) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && !(cond == 0bv32)) && a == a) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || ((((((((((b == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a)) || (((a == b && !~bvult64(\result, b)) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && !(cond == 0bv32)) && b == a) && ~bvult64(a, __retres10)) && ~bvult64(a, \result)) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))))) && 1bv32 == sa) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))))) && !~bvult64(__retres10, b)))) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && 1bv32 == tmp___0)) || (((((((((\result == b && mb == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea))) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a)))) && !(cond == 0bv32)) && !(0bv32 == a)) && b == a) && __retres10 == b) && ~bvult64(a, \result)) && a == b) && ~bvult64(~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea), 32bv32))) || (((((((b == b && ((!~bvult64(a, b) && __retres10 == a) && a == a) && \result == a) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && !(cond == 0bv32)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) || ((((!~bvsgt32(sa, 0bv32) && !~bvult64(a, b)) && __retres10 == a) && a == a) && \result == a) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 0bv32 == a || zero == 0bv32 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0bv32 == a || zero == 0bv32 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: zero == 0bv32 - InvariantResult [Line: 284]: Loop Invariant [2019-11-16 00:46:18,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] Derived loop invariant: ((((((((1bv32 == sa && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && !~bvult64(r_add, b)) && ((((((((((((!~bvult64(r_add, a) && a == a) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) || ((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a))))) && ~bvsge32(tmp___2, 0bv32)) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && b == a) || (((((((!~bvult64(r_add, a) && a == a) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) || ((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a))))) && ~bvsge32(tmp___2, 0bv32)) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a)) && (forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || ((((((((((!~bvult64(r_add, a) && a == a) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) || ((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a))))) && ~bvsge32(tmp___2, 0bv32)) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && b == a) || (((((((!~bvult64(r_add, a) && a == a) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) || ((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(0bv32 == a))))) && ~bvsge32(tmp___2, 0bv32)) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a)) && ~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32)) && a == a))) && !~bvult64(\result, b)) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)) || ((((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && a == a) && (((~bvsge32(tmp___2, 0bv32) && (!~bvult64(r_add, a) && (((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) || ((!~bvugt32(r_add, a) && !~bvult64(a, b)) && b == b))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && ~bvsge32(tmp___1, 0bv32)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && (!(0bv32 == ~bvand64(33554432bv32, ma)) || !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a))) || ((((((((mb == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)) && 1bv32 == tmp___2) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a)))) && (((\result == b && __retres10 == b) && a == b) && r_add == b) && !(0bv32 == a)) && b == a) && 1bv32 == tmp___1) && ~bvult64(a, \result)) && ~bvult64(~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea), 32bv32))) || ((1bv32 == sb && ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && ((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && ((((~bvult64(a, r_add) && !(0bv32 == b)) && a == a) && (((((((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)) || (((((((!(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)))) || (((((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b)) && ~bvult64(a, __retres10)) && ~bvult64(a, \result)) && (((((((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)) || (((((((!(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)))))) && b == a) || ((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && ((((~bvult64(a, r_add) && !(0bv32 == b)) && a == a) && (((((((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)) || (((((((!(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)))) || (((((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b)) && ~bvult64(a, __retres10)) && ~bvult64(a, \result)) && (((((((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)) || (((((((!(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !~bvult64(r_add, b)) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(a, ULTIMATE.start_main_~zero~0))) && !~bvult64(\result, b)) && !(0bv32 == a)) && !~bvult64(__retres10, b)))))) && a == a)) && ((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32)) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))))) || (((b == b && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && ((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32) && (((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a) || (((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) || ((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(\result, a)) && (((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a) || (((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) && !~bvult64(__retres10, a))))) || ((((((1bv32 == sa && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && !~bvult64(r_add, b)) && ((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32) && (((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a) || (((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) || ((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(\result, a)) && (((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && a == a) || (((((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ((((~bvult64(a, r_add) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a) || (((~bvult64(a, r_add) && ~bvult64(a, a)) && (((b == b && !(cond == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && !(cond == 0bv32) && !~bvult64(a, b)) && a == b) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))))) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a)))) && !~bvult64(__retres10, a)))) && !~bvult64(\result, b)) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)))) && 1bv32 == tmp___0) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 303]: Loop Invariant [2019-11-16 00:46:18,529 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,529 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] Derived loop invariant: (((((a == b && r_add == b) && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || ((((r_add == a && !~bvult64(a, b)) && __retres10 == a) && a == a) && \result == a) || (!~bvugt32(r_add, a) && 0bv32 == a && 0bv32 == b)) || (((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((b == b && !~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && !(0bv32 == a)) || ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(cond == 0bv32)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0)))) || (((!~bvult64(r_add, a) && ((((b == b && !~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && !(0bv32 == a)) || ((((!(0bv32 == b) && !~bvugt32(r_add, a) && !~bvult64(a, b)) && a == b) && !(cond == 0bv32)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) || ((b == b && r_add == b) && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: zero == 0bv32 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 0bv32 == a || zero == 0bv32 - InvariantResult [Line: 240]: Loop Invariant [2019-11-16 00:46:18,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] Derived loop invariant: ((((((~bvult64(a, a) && !~bvult64(r_add, a)) && ((((!(0bv32 == b) && (!~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && b == b) && !(0bv32 == a)) || (((!(0bv32 == b) && (!~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && a == b) && !(0bv32 == a)))) || ((((r_add == a && !~bvult64(a, b)) && __retres10 == a) && a == a) && \result == a) || (!~bvugt32(r_add, a) && 0bv32 == a && 0bv32 == b)) || (((!~bvult64(r_add, a) && ((!~bvugt32(r_add, a) && !~bvult64(a, b)) && !(cond == 0bv32)) && b == b) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && r_add == b)) || (((1bv32 == sb && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && 1bv32 == tmp___0) && ((((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && !~bvult64(\result, b)) && (((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((((\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(__retres10, a)) || ((((((((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) || (a == a && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || (((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32) && (((((((\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(__retres10, a)) || ((((((((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) || (a == a && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32))))) && !(0bv32 == sa)) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))))) && !~bvult64(__retres10, b)) || (b == b && (((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((((\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(__retres10, a)) || ((((((((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) || (a == a && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)))) && !~bvult64(\result, a)) && !~bvult64(__retres10, a)) || (((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32) && (((((((\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a)) && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(__retres10, a)) || ((((((((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32)) && !~bvult64(\result, a)) && b == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) || (a == a && (((~bvult64(a, r_add) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)))) && a == a) || ((~bvult64(a, r_add) && ~bvult64(a, a)) && !(0bv32 == b) && (((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b)) || ((a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && !~bvult64(r_add, b))))) && !(cond == 0bv32))))) && !(0bv32 == sa))) || (((((a == b && !~bvult64(r_add, b)) && !~bvult64(\result, b)) && ((((((((!~bvult64(r_add, a) && !(cond == 0bv32)) && ((~bvult64(a, a) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) || ((!(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && a == a))) && !~bvult64(\result, a)) && b == a) || ((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ~bvult64(a, r_add) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && !(cond == 0bv32)) && a == a)) || ((((((!~bvult64(r_add, a) && !(cond == 0bv32)) && a == a) && ((~bvult64(a, a) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) || ((!(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && a == a))) && !~bvult64(\result, a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) && ((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 129bv32), 24bv32)), a)) || ~bvadd64(ea, 4294967169bv32) == 0bv32)) || (((((((!~bvult64(r_add, a) && !(cond == 0bv32)) && ((~bvult64(a, a) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) || ((!(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && a == a))) && !~bvult64(\result, a)) && b == a) || ((((1bv32 == tmp___1 && 1bv32 == tmp___2) && ~bvult64(a, r_add) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && !(cond == 0bv32)) && a == a)) || ((((((!~bvult64(r_add, a) && !(cond == 0bv32)) && a == a) && ((~bvult64(a, a) && !(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) || ((!(0bv32 == b) && ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) || (a == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))))) && a == a))) && !~bvult64(\result, a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && !~bvult64(__retres10, a))) && (forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) && !(0bv32 == sa)) && !~bvult64(__retres10, b)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b))))) || ((b == b && !(0bv32 == a) && (~bvult64(b, a) || (!~bvult64(a, b) && !(cond == 0bv32)))) && r_add == b) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant [2019-11-16 00:46:18,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-16 00:46:18,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-16 00:46:18,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-16 00:46:18,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-16 00:46:18,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-16 00:46:18,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-16 00:46:18,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] Derived loop invariant: (1bv32 == sb && (((((((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == a) || (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) || ((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && (((((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == a) || (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) && a == a)) && b == b) && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)) || (((((~bvadd64(ea, 128bv32) == ~bvlshr64(b, 24bv32) && !(~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b)))) == 0bv32)) && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (\exists ULTIMATE.start_addflt_~a : bv32 :: (~bvadd64(ea, 128bv32) == ~bvlshr64(ULTIMATE.start_addflt_~a, 24bv32) && ~bvadd64(ma, ~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~a))) && ~bvult64(a, ULTIMATE.start_addflt_~a))) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, a)), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(a, 24bv32), 4294967168bv32)), ea)))) && b == a) && (\exists ULTIMATE.start_addflt_~delta~0 : bv32, ULTIMATE.start_addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, ULTIMATE.start_addflt_~b)), ULTIMATE.start_addflt_~delta~0) == ~bvadd64(ma, ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, b))))))) || (((((((forall ULTIMATE.start_addflt_~ma~0 : bv32 :: !~bvult64(~bvor32(~bvand64(16777215bv32, ULTIMATE.start_addflt_~ma~0), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)) && (((((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == a) || (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) || ((~bvadd64(ea, 128bv32) == ~bvlshr64(a, 24bv32) && (((((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, mb)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, mb))))) && (!(0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma))) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(~bvneg32(eb), ea)), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a))) && b == a) || (((((~bvult64(a, a) && (((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) || (((((b == b && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a)) || (((!(0bv32 == b) && a == b) && (~bvult64(ma, 33554432bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvult64(a, b)) && !(0bv32 == a))) && (\exists ULTIMATE.start_main_~zero~0 : bv32 :: ~bvugt32(b, ULTIMATE.start_main_~zero~0))) && a == a)) && a == a) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), a)))) && a == a)) && 1bv32 == sa) && ~bvadd64(tmp, 4294967295bv32) == 0bv32) && (forall v_ULTIMATE.start_addflt_~delta~0_24 : bv32 :: (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(ma, ~bvlshr64(mb, v_ULTIMATE.start_addflt_~delta~0_24))), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b) || !(0bv32 == ~bvand64(33554432bv32, ~bvadd64(ma, ~bvlshr64(mb, v_ULTIMATE.start_addflt_~delta~0_24))))) || 0bv32 == ~bvlshr64(mb, v_ULTIMATE.start_addflt_~delta~0_24))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), b)))) && 1bv32 == tmp___0 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: zero == 0bv32 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (0bv32 == a || zero == 0bv32) || 0bv32 == __retres4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 5 error locations. Result: SAFE, OverallTime: 235.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 50.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 167.5s, HoareTripleCheckerStatistics: 3739 SDtfs, 9989 SDslu, 15597 SDs, 0 SdLazy, 4515 SolverSat, 338 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 24.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2186 GetRequests, 1805 SyntacticMatches, 13 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 30.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 3881 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 132 NumberOfFragments, 9579 HoareAnnotationTreeSize, 24 FomulaSimplifications, 461352475164 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 24 FomulaSimplificationsInter, 2871233186 FormulaSimplificationTreeSizeReductionInter, 164.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1020 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1984 ConstructedInterpolants, 79 QuantifiedInterpolants, 239378 SizeOfPredicates, 169 NumberOfNonLiveVariables, 2062 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 56 InterpolantComputations, 56 PerfectInterpolantSequences, 0/0 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...