./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-678e011 [2019-11-20 03:49:54,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:49:54,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:49:54,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:49:54,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:49:54,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:49:54,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:49:54,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:49:54,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:49:54,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:49:54,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:49:54,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:49:54,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:49:54,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:49:54,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:49:54,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:49:54,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:49:54,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:49:54,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:49:54,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:49:54,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:49:54,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:49:54,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:49:54,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:49:54,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:49:54,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:49:54,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:49:54,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:49:54,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:49:54,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:49:54,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:49:54,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:49:54,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:49:54,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:49:54,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:49:54,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:49:54,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:49:54,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:49:54,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:49:54,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:49:54,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:49:54,810 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:49:54,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:49:54,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:49:54,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:49:54,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:49:54,837 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:49:54,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:49:54,837 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:49:54,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:49:54,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:49:54,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:49:54,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:49:54,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:49:54,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:49:54,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:49:54,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:49:54,839 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:49:54,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:49:54,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:49:54,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:49:54,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:49:54,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:49:54,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:49:54,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:49:54,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:49:54,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:49:54,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:49:54,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:49:54,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:49:54,842 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_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:49:54,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:49:55,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:49:55,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:49:55,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:49:55,015 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:49:55,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-20 03:49:55,069 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data/5f45320b7/a23371e5fe5b4dd8b2cb38e2e76d203d/FLAG484c03f6a [2019-11-20 03:49:55,478 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:49:55,479 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-20 03:49:55,496 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data/5f45320b7/a23371e5fe5b4dd8b2cb38e2e76d203d/FLAG484c03f6a [2019-11-20 03:49:55,793 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data/5f45320b7/a23371e5fe5b4dd8b2cb38e2e76d203d [2019-11-20 03:49:55,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:49:55,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:49:55,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:49:55,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:49:55,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:49:55,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:49:55" (1/1) ... [2019-11-20 03:49:55,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c03189c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:55, skipping insertion in model container [2019-11-20 03:49:55,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:49:55" (1/1) ... [2019-11-20 03:49:55,810 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:49:55,838 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:49:56,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:49:56,110 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:49:56,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:49:56,168 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:49:56,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56 WrapperNode [2019-11-20 03:49:56,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:49:56,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:49:56,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:49:56,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:49:56,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... [2019-11-20 03:49:56,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... [2019-11-20 03:49:56,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:49:56,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:49:56,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:49:56,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:49:56,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... [2019-11-20 03:49:56,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... [2019-11-20 03:49:56,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... [2019-11-20 03:49:56,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... [2019-11-20 03:49:56,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... [2019-11-20 03:49:56,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... [2019-11-20 03:49:56,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... [2019-11-20 03:49:56,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:49:56,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:49:56,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:49:56,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:49:56,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:49:56,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:49:56,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:49:56,905 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:49:56,905 INFO L285 CfgBuilder]: Removed 28 assume(true) statements. [2019-11-20 03:49:56,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:49:56 BoogieIcfgContainer [2019-11-20 03:49:56,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:49:56,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:49:56,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:49:56,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:49:56,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:49:55" (1/3) ... [2019-11-20 03:49:56,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74dd81e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:49:56, skipping insertion in model container [2019-11-20 03:49:56,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:49:56" (2/3) ... [2019-11-20 03:49:56,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74dd81e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:49:56, skipping insertion in model container [2019-11-20 03:49:56,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:49:56" (3/3) ... [2019-11-20 03:49:56,915 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2019-11-20 03:49:56,925 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:49:56,932 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-20 03:49:56,943 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-20 03:49:56,968 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:49:56,969 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:49:56,969 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:49:56,969 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:49:56,969 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:49:56,969 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:49:56,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:49:56,970 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:49:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-11-20 03:49:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:49:56,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:56,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:49:56,997 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:57,003 INFO L82 PathProgramCache]: Analyzing trace with hash 934616753, now seen corresponding path program 1 times [2019-11-20 03:49:57,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:57,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120597729] [2019-11-20 03:49:57,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:57,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-20 03:49:57,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120597729] [2019-11-20 03:49:57,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:49:57,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 03:49:57,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092505705] [2019-11-20 03:49:57,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:49:57,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:57,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:49:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:49:57,380 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 8 states. [2019-11-20 03:49:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:49:58,063 INFO L93 Difference]: Finished difference Result 434 states and 663 transitions. [2019-11-20 03:49:58,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 03:49:58,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-20 03:49:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:49:58,085 INFO L225 Difference]: With dead ends: 434 [2019-11-20 03:49:58,087 INFO L226 Difference]: Without dead ends: 321 [2019-11-20 03:49:58,093 INFO L630 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-20 03:49:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-20 03:49:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 127. [2019-11-20 03:49:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-20 03:49:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2019-11-20 03:49:58,185 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 17 [2019-11-20 03:49:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:49:58,185 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2019-11-20 03:49:58,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:49:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2019-11-20 03:49:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:49:58,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:58,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:49:58,189 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash 934676335, now seen corresponding path program 1 times [2019-11-20 03:49:58,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:58,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349738427] [2019-11-20 03:49:58,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:49:58,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349738427] [2019-11-20 03:49:58,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:49:58,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 03:49:58,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915492644] [2019-11-20 03:49:58,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:49:58,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:58,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:49:58,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:49:58,406 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand 7 states. [2019-11-20 03:49:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:49:58,692 INFO L93 Difference]: Finished difference Result 276 states and 396 transitions. [2019-11-20 03:49:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:49:58,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-20 03:49:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:49:58,695 INFO L225 Difference]: With dead ends: 276 [2019-11-20 03:49:58,695 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 03:49:58,697 INFO L630 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-20 03:49:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 03:49:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-11-20 03:49:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-20 03:49:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 267 transitions. [2019-11-20 03:49:58,736 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 267 transitions. Word has length 17 [2019-11-20 03:49:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:49:58,736 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 267 transitions. [2019-11-20 03:49:58,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:49:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 267 transitions. [2019-11-20 03:49:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:49:58,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:58,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:49:58,740 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1341099622, now seen corresponding path program 1 times [2019-11-20 03:49:58,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:58,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874789614] [2019-11-20 03:49:58,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:49:58,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874789614] [2019-11-20 03:49:58,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:49:58,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 03:49:58,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824818539] [2019-11-20 03:49:58,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:49:58,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:58,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:49:58,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:49:58,990 INFO L87 Difference]: Start difference. First operand 187 states and 267 transitions. Second operand 8 states. [2019-11-20 03:49:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:49:59,426 INFO L93 Difference]: Finished difference Result 296 states and 396 transitions. [2019-11-20 03:49:59,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 03:49:59,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-20 03:49:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:49:59,432 INFO L225 Difference]: With dead ends: 296 [2019-11-20 03:49:59,432 INFO L226 Difference]: Without dead ends: 252 [2019-11-20 03:49:59,433 INFO L630 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-20 03:49:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-20 03:49:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 178. [2019-11-20 03:49:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-20 03:49:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 252 transitions. [2019-11-20 03:49:59,457 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 252 transitions. Word has length 21 [2019-11-20 03:49:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:49:59,461 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 252 transitions. [2019-11-20 03:49:59,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:49:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 252 transitions. [2019-11-20 03:49:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:49:59,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:59,472 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:49:59,472 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:59,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:59,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1019232809, now seen corresponding path program 1 times [2019-11-20 03:49:59,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:59,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79135930] [2019-11-20 03:49:59,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:49:59,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79135930] [2019-11-20 03:49:59,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:49:59,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:49:59,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200784038] [2019-11-20 03:49:59,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:49:59,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:59,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:49:59,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:49:59,534 INFO L87 Difference]: Start difference. First operand 178 states and 252 transitions. Second operand 3 states. [2019-11-20 03:49:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:49:59,558 INFO L93 Difference]: Finished difference Result 328 states and 464 transitions. [2019-11-20 03:49:59,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:49:59,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 03:49:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:49:59,563 INFO L225 Difference]: With dead ends: 328 [2019-11-20 03:49:59,563 INFO L226 Difference]: Without dead ends: 253 [2019-11-20 03:49:59,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:49:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-20 03:49:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2019-11-20 03:49:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-20 03:49:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2019-11-20 03:49:59,587 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 25 [2019-11-20 03:49:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:49:59,587 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2019-11-20 03:49:59,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:49:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2019-11-20 03:49:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:49:59,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:59,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:49:59,594 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash 186737553, now seen corresponding path program 1 times [2019-11-20 03:49:59,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:59,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302982690] [2019-11-20 03:49:59,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:49:59,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302982690] [2019-11-20 03:49:59,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:49:59,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:49:59,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477777276] [2019-11-20 03:49:59,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:49:59,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:59,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:49:59,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:49:59,750 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand 6 states. [2019-11-20 03:49:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:49:59,934 INFO L93 Difference]: Finished difference Result 348 states and 479 transitions. [2019-11-20 03:49:59,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:49:59,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 03:49:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:49:59,936 INFO L225 Difference]: With dead ends: 348 [2019-11-20 03:49:59,936 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 03:49:59,938 INFO L630 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-20 03:49:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 03:49:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2019-11-20 03:49:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-20 03:49:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 244 transitions. [2019-11-20 03:49:59,950 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 244 transitions. Word has length 25 [2019-11-20 03:49:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:49:59,950 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 244 transitions. [2019-11-20 03:49:59,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:49:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 244 transitions. [2019-11-20 03:49:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 03:49:59,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:59,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:49:59,952 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 501595191, now seen corresponding path program 1 times [2019-11-20 03:49:59,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:59,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234523020] [2019-11-20 03:49:59,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:49:59,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234523020] [2019-11-20 03:49:59,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:49:59,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:49:59,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549633100] [2019-11-20 03:49:59,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:49:59,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:59,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:49:59,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:49:59,993 INFO L87 Difference]: Start difference. First operand 178 states and 244 transitions. Second operand 5 states. [2019-11-20 03:50:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:00,069 INFO L93 Difference]: Finished difference Result 305 states and 422 transitions. [2019-11-20 03:50:00,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:50:00,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-20 03:50:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:00,071 INFO L225 Difference]: With dead ends: 305 [2019-11-20 03:50:00,071 INFO L226 Difference]: Without dead ends: 230 [2019-11-20 03:50:00,072 INFO L630 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-20 03:50:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-20 03:50:00,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 184. [2019-11-20 03:50:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-20 03:50:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 245 transitions. [2019-11-20 03:50:00,107 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 245 transitions. Word has length 29 [2019-11-20 03:50:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:00,109 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 245 transitions. [2019-11-20 03:50:00,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:50:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 245 transitions. [2019-11-20 03:50:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 03:50:00,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:00,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:00,113 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:00,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1737423153, now seen corresponding path program 1 times [2019-11-20 03:50:00,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:50:00,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863266191] [2019-11-20 03:50:00,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:50:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:50:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:50:00,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:50:00,240 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 03:50:00,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:50:00 BoogieIcfgContainer [2019-11-20 03:50:00,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:50:00,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:50:00,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:50:00,298 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:50:00,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:49:56" (3/4) ... [2019-11-20 03:50:00,303 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 03:50:00,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:50:00,306 INFO L168 Benchmark]: Toolchain (without parser) took 4508.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -240.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:50:00,307 INFO L168 Benchmark]: CDTParser took 0.29 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-20 03:50:00,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:50:00,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.71 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:50:00,313 INFO L168 Benchmark]: Boogie Preprocessor took 58.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:50:00,313 INFO L168 Benchmark]: RCFGBuilder took 634.83 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.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:50:00,314 INFO L168 Benchmark]: TraceAbstraction took 3385.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:50:00,314 INFO L168 Benchmark]: Witness Printer took 9.81 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-20 03:50:00,320 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.29 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 371.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.71 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.87 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 634.83 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.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3385.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 9.81 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.3s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 1.7s, 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 363 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s 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-678e011 [2019-11-20 03:50:02,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:50:02,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:50:02,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:50:02,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:50:02,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:50:02,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:50:02,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:50:02,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:50:02,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:50:02,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:50:02,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:50:02,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:50:02,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:50:02,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:50:02,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:50:02,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:50:02,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:50:02,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:50:02,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:50:02,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:50:02,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:50:02,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:50:02,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:50:02,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:50:02,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:50:02,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:50:02,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:50:02,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:50:02,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:50:02,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:50:02,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:50:02,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:50:02,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:50:02,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:50:02,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:50:02,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:50:02,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:50:02,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:50:02,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:50:02,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:50:02,359 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 03:50:02,378 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:50:02,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:50:02,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:50:02,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:50:02,380 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:50:02,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:50:02,380 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:50:02,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:50:02,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:50:02,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:50:02,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:50:02,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:50:02,382 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:50:02,382 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:50:02,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:50:02,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:50:02,383 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:50:02,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:50:02,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:50:02,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:50:02,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:50:02,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:50:02,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:50:02,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:50:02,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:50:02,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:50:02,386 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 03:50:02,386 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:50:02,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:50:02,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:50:02,387 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_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:02,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:50:02,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:50:02,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:50:02,704 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:50:02,705 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:50:02,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-20 03:50:02,766 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data/7a3c84623/249f7f8ae0ef4b9ba0cfa2b0402a1e69/FLAG078bd69d1 [2019-11-20 03:50:03,208 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:50:03,208 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-20 03:50:03,225 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data/7a3c84623/249f7f8ae0ef4b9ba0cfa2b0402a1e69/FLAG078bd69d1 [2019-11-20 03:50:03,576 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/data/7a3c84623/249f7f8ae0ef4b9ba0cfa2b0402a1e69 [2019-11-20 03:50:03,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:50:03,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:50:03,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:50:03,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:50:03,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:50:03,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:50:03" (1/1) ... [2019-11-20 03:50:03,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24200bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:03, skipping insertion in model container [2019-11-20 03:50:03,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:50:03" (1/1) ... [2019-11-20 03:50:03,598 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:50:03,655 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:50:03,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:50:03,940 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:50:04,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:50:04,065 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:50:04,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04 WrapperNode [2019-11-20 03:50:04,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:50:04,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:50:04,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:50:04,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:50:04,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... [2019-11-20 03:50:04,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... [2019-11-20 03:50:04,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:50:04,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:50:04,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:50:04,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:50:04,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... [2019-11-20 03:50:04,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... [2019-11-20 03:50:04,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... [2019-11-20 03:50:04,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... [2019-11-20 03:50:04,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... [2019-11-20 03:50:04,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... [2019-11-20 03:50:04,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... [2019-11-20 03:50:04,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:50:04,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:50:04,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:50:04,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:50:04,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:50:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:50:04,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:50:04,721 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:50:04,721 INFO L285 CfgBuilder]: Removed 28 assume(true) statements. [2019-11-20 03:50:04,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:50:04 BoogieIcfgContainer [2019-11-20 03:50:04,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:50:04,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:50:04,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:50:04,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:50:04,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:50:03" (1/3) ... [2019-11-20 03:50:04,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4a4f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:50:04, skipping insertion in model container [2019-11-20 03:50:04,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:04" (2/3) ... [2019-11-20 03:50:04,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4a4f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:50:04, skipping insertion in model container [2019-11-20 03:50:04,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:50:04" (3/3) ... [2019-11-20 03:50:04,728 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2019-11-20 03:50:04,734 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:50:04,739 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-20 03:50:04,747 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-20 03:50:04,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:50:04,771 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:50:04,771 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:50:04,771 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:50:04,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:50:04,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:50:04,772 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:50:04,772 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:50:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-11-20 03:50:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:50:04,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:04,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:04,802 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:04,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash 934616753, now seen corresponding path program 1 times [2019-11-20 03:50:04,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:04,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [77728212] [2019-11-20 03:50:04,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:04,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:50:04,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:04,997 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:05,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [77728212] [2019-11-20 03:50:05,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:05,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-20 03:50:05,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498052062] [2019-11-20 03:50:05,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:50:05,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:05,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:50:05,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:50:05,048 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 7 states. [2019-11-20 03:50:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:05,652 INFO L93 Difference]: Finished difference Result 485 states and 736 transitions. [2019-11-20 03:50:05,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 03:50:05,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-20 03:50:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:05,669 INFO L225 Difference]: With dead ends: 485 [2019-11-20 03:50:05,669 INFO L226 Difference]: Without dead ends: 371 [2019-11-20 03:50:05,673 INFO L630 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-20 03:50:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-20 03:50:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 126. [2019-11-20 03:50:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-20 03:50:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2019-11-20 03:50:05,736 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 17 [2019-11-20 03:50:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:05,738 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2019-11-20 03:50:05,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:50:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2019-11-20 03:50:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:50:05,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:05,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:05,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:05,945 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:05,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:05,945 INFO L82 PathProgramCache]: Analyzing trace with hash 216177638, now seen corresponding path program 1 times [2019-11-20 03:50:05,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:05,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [308388259] [2019-11-20 03:50:05,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:06,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:50:06,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:06,063 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:06,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [308388259] [2019-11-20 03:50:06,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:06,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 03:50:06,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674115768] [2019-11-20 03:50:06,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:50:06,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:06,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:50:06,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:50:06,093 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand 5 states. [2019-11-20 03:50:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:06,299 INFO L93 Difference]: Finished difference Result 481 states and 685 transitions. [2019-11-20 03:50:06,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:50:06,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-20 03:50:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:06,307 INFO L225 Difference]: With dead ends: 481 [2019-11-20 03:50:06,307 INFO L226 Difference]: Without dead ends: 408 [2019-11-20 03:50:06,310 INFO L630 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-20 03:50:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-20 03:50:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 171. [2019-11-20 03:50:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 03:50:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 247 transitions. [2019-11-20 03:50:06,356 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 247 transitions. Word has length 21 [2019-11-20 03:50:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:06,356 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 247 transitions. [2019-11-20 03:50:06,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:50:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2019-11-20 03:50:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:50:06,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:06,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:06,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:06,570 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:06,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:06,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1163788538, now seen corresponding path program 1 times [2019-11-20 03:50:06,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:06,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [815412411] [2019-11-20 03:50:06,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:06,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:50:06,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:06,676 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:06,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [815412411] [2019-11-20 03:50:06,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:06,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 03:50:06,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956906587] [2019-11-20 03:50:06,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:50:06,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:50:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:50:06,694 INFO L87 Difference]: Start difference. First operand 171 states and 247 transitions. Second operand 5 states. [2019-11-20 03:50:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:06,869 INFO L93 Difference]: Finished difference Result 335 states and 471 transitions. [2019-11-20 03:50:06,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:50:06,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-20 03:50:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:06,872 INFO L225 Difference]: With dead ends: 335 [2019-11-20 03:50:06,873 INFO L226 Difference]: Without dead ends: 266 [2019-11-20 03:50:06,874 INFO L630 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-20 03:50:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-20 03:50:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 251. [2019-11-20 03:50:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-20 03:50:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 359 transitions. [2019-11-20 03:50:06,901 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 359 transitions. Word has length 25 [2019-11-20 03:50:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:06,902 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 359 transitions. [2019-11-20 03:50:06,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:50:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 359 transitions. [2019-11-20 03:50:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:50:06,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:06,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:07,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:07,114 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash 611218824, now seen corresponding path program 1 times [2019-11-20 03:50:07,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:07,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1403934020] [2019-11-20 03:50:07,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:07,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:50:07,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:07,233 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:07,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1403934020] [2019-11-20 03:50:07,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:07,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 03:50:07,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530091694] [2019-11-20 03:50:07,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:50:07,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:50:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:50:07,374 INFO L87 Difference]: Start difference. First operand 251 states and 359 transitions. Second operand 8 states. [2019-11-20 03:50:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:09,626 INFO L93 Difference]: Finished difference Result 1039 states and 1474 transitions. [2019-11-20 03:50:09,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 03:50:09,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-20 03:50:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:09,636 INFO L225 Difference]: With dead ends: 1039 [2019-11-20 03:50:09,636 INFO L226 Difference]: Without dead ends: 928 [2019-11-20 03:50:09,639 INFO L630 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-20 03:50:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-11-20 03:50:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 271. [2019-11-20 03:50:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-20 03:50:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 385 transitions. [2019-11-20 03:50:09,662 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 385 transitions. Word has length 25 [2019-11-20 03:50:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:09,663 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 385 transitions. [2019-11-20 03:50:09,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:50:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 385 transitions. [2019-11-20 03:50:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:50:09,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:09,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:09,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:09,870 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash 611278406, now seen corresponding path program 1 times [2019-11-20 03:50:09,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:09,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1615974630] [2019-11-20 03:50:09,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:09,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:50:09,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:09,963 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:09,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1615974630] [2019-11-20 03:50:09,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:09,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-20 03:50:09,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037684452] [2019-11-20 03:50:09,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:50:09,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:09,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:50:09,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:50:09,968 INFO L87 Difference]: Start difference. First operand 271 states and 385 transitions. Second operand 6 states. [2019-11-20 03:50:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:10,131 INFO L93 Difference]: Finished difference Result 369 states and 510 transitions. [2019-11-20 03:50:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:50:10,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 03:50:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:10,136 INFO L225 Difference]: With dead ends: 369 [2019-11-20 03:50:10,136 INFO L226 Difference]: Without dead ends: 306 [2019-11-20 03:50:10,137 INFO L630 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-20 03:50:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-20 03:50:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 253. [2019-11-20 03:50:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-20 03:50:10,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 357 transitions. [2019-11-20 03:50:10,149 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 357 transitions. Word has length 25 [2019-11-20 03:50:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:10,150 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 357 transitions. [2019-11-20 03:50:10,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:50:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 357 transitions. [2019-11-20 03:50:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 03:50:10,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:10,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:10,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:10,354 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:10,354 INFO L82 PathProgramCache]: Analyzing trace with hash 501595191, now seen corresponding path program 1 times [2019-11-20 03:50:10,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:10,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [24841156] [2019-11-20 03:50:10,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:10,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:50:10,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:10,433 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:10,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [24841156] [2019-11-20 03:50:10,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:10,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 03:50:10,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133488259] [2019-11-20 03:50:10,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:50:10,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:10,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:50:10,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:50:10,480 INFO L87 Difference]: Start difference. First operand 253 states and 357 transitions. Second operand 10 states. [2019-11-20 03:50:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:10,999 INFO L93 Difference]: Finished difference Result 494 states and 685 transitions. [2019-11-20 03:50:11,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:50:11,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-20 03:50:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:11,003 INFO L225 Difference]: With dead ends: 494 [2019-11-20 03:50:11,003 INFO L226 Difference]: Without dead ends: 431 [2019-11-20 03:50:11,004 INFO L630 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-20 03:50:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-20 03:50:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 261. [2019-11-20 03:50:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-20 03:50:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 369 transitions. [2019-11-20 03:50:11,021 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 369 transitions. Word has length 29 [2019-11-20 03:50:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:11,021 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 369 transitions. [2019-11-20 03:50:11,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:50:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 369 transitions. [2019-11-20 03:50:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 03:50:11,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:11,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:11,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:11,230 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash 503442233, now seen corresponding path program 1 times [2019-11-20 03:50:11,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:11,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1864596268] [2019-11-20 03:50:11,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:11,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:50:11,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:11,343 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:11,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1864596268] [2019-11-20 03:50:11,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:11,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:50:11,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7856087] [2019-11-20 03:50:11,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:50:11,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:11,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:50:11,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:50:11,360 INFO L87 Difference]: Start difference. First operand 261 states and 369 transitions. Second operand 6 states. [2019-11-20 03:50:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:11,420 INFO L93 Difference]: Finished difference Result 496 states and 688 transitions. [2019-11-20 03:50:11,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:50:11,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-20 03:50:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:11,424 INFO L225 Difference]: With dead ends: 496 [2019-11-20 03:50:11,424 INFO L226 Difference]: Without dead ends: 409 [2019-11-20 03:50:11,425 INFO L630 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-20 03:50:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-11-20 03:50:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 335. [2019-11-20 03:50:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-20 03:50:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 461 transitions. [2019-11-20 03:50:11,448 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 461 transitions. Word has length 29 [2019-11-20 03:50:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:11,449 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 461 transitions. [2019-11-20 03:50:11,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:50:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 461 transitions. [2019-11-20 03:50:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 03:50:11,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:11,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:11,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:11,654 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:11,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:11,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1737423153, now seen corresponding path program 1 times [2019-11-20 03:50:11,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:11,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1831361255] [2019-11-20 03:50:11,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:11,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 03:50:11,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:11,784 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:11,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1831361255] [2019-11-20 03:50:11,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:11,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:50:11,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842668643] [2019-11-20 03:50:11,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:50:11,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:11,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:50:11,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:50:11,813 INFO L87 Difference]: Start difference. First operand 335 states and 461 transitions. Second operand 6 states. [2019-11-20 03:50:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:12,014 INFO L93 Difference]: Finished difference Result 524 states and 719 transitions. [2019-11-20 03:50:12,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:50:12,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-20 03:50:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:12,018 INFO L225 Difference]: With dead ends: 524 [2019-11-20 03:50:12,018 INFO L226 Difference]: Without dead ends: 522 [2019-11-20 03:50:12,019 INFO L630 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-20 03:50:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-20 03:50:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 333. [2019-11-20 03:50:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-20 03:50:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 454 transitions. [2019-11-20 03:50:12,049 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 454 transitions. Word has length 29 [2019-11-20 03:50:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:12,049 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 454 transitions. [2019-11-20 03:50:12,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:50:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 454 transitions. [2019-11-20 03:50:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 03:50:12,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:12,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:12,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:12,257 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:12,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1508425246, now seen corresponding path program 1 times [2019-11-20 03:50:12,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:12,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1731448897] [2019-11-20 03:50:12,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:12,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:50:12,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:12,329 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:12,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1731448897] [2019-11-20 03:50:12,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:12,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:50:12,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818846994] [2019-11-20 03:50:12,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:50:12,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:50:12,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:50:12,346 INFO L87 Difference]: Start difference. First operand 333 states and 454 transitions. Second operand 6 states. [2019-11-20 03:50:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:12,442 INFO L93 Difference]: Finished difference Result 392 states and 528 transitions. [2019-11-20 03:50:12,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:50:12,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-20 03:50:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:12,445 INFO L225 Difference]: With dead ends: 392 [2019-11-20 03:50:12,445 INFO L226 Difference]: Without dead ends: 387 [2019-11-20 03:50:12,445 INFO L630 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-20 03:50:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-20 03:50:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 333. [2019-11-20 03:50:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-20 03:50:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2019-11-20 03:50:12,472 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 30 [2019-11-20 03:50:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:12,472 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2019-11-20 03:50:12,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:50:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2019-11-20 03:50:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 03:50:12,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:12,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:12,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:12,682 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1775795376, now seen corresponding path program 1 times [2019-11-20 03:50:12,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:12,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1237276789] [2019-11-20 03:50:12,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:12,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:50:12,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:12,791 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:12,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1237276789] [2019-11-20 03:50:12,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:12,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:50:12,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794727883] [2019-11-20 03:50:12,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:50:12,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:12,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:50:12,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:50:12,818 INFO L87 Difference]: Start difference. First operand 333 states and 451 transitions. Second operand 6 states. [2019-11-20 03:50:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:12,899 INFO L93 Difference]: Finished difference Result 621 states and 822 transitions. [2019-11-20 03:50:12,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:50:12,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-20 03:50:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:12,903 INFO L225 Difference]: With dead ends: 621 [2019-11-20 03:50:12,903 INFO L226 Difference]: Without dead ends: 551 [2019-11-20 03:50:12,904 INFO L630 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-20 03:50:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-11-20 03:50:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 340. [2019-11-20 03:50:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-20 03:50:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 461 transitions. [2019-11-20 03:50:12,930 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 461 transitions. Word has length 33 [2019-11-20 03:50:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:12,930 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 461 transitions. [2019-11-20 03:50:12,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:50:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 461 transitions. [2019-11-20 03:50:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:50:12,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:12,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:13,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:13,142 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash 51304021, now seen corresponding path program 1 times [2019-11-20 03:50:13,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:13,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [446144652] [2019-11-20 03:50:13,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:13,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:50:13,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:13,211 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:13,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [446144652] [2019-11-20 03:50:13,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:13,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 03:50:13,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029674131] [2019-11-20 03:50:13,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:50:13,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:50:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:50:13,215 INFO L87 Difference]: Start difference. First operand 340 states and 461 transitions. Second operand 4 states. [2019-11-20 03:50:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:13,259 INFO L93 Difference]: Finished difference Result 350 states and 472 transitions. [2019-11-20 03:50:13,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:50:13,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-20 03:50:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:13,262 INFO L225 Difference]: With dead ends: 350 [2019-11-20 03:50:13,262 INFO L226 Difference]: Without dead ends: 262 [2019-11-20 03:50:13,263 INFO L630 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-20 03:50:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-20 03:50:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2019-11-20 03:50:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 03:50:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 346 transitions. [2019-11-20 03:50:13,282 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 346 transitions. Word has length 34 [2019-11-20 03:50:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:13,282 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 346 transitions. [2019-11-20 03:50:13,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:50:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 346 transitions. [2019-11-20 03:50:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:50:13,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:13,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:13,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:13,486 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:13,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:13,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2082740230, now seen corresponding path program 1 times [2019-11-20 03:50:13,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:13,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [258018290] [2019-11-20 03:50:13,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:13,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:50:13,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:15,691 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 17 [2019-11-20 03:50:15,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:15,836 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:16,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-20 03:50:16,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [258018290] [2019-11-20 03:50:16,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:16,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 03:50:16,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145430636] [2019-11-20 03:50:16,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:50:16,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:50:16,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:50:16,055 INFO L87 Difference]: Start difference. First operand 259 states and 346 transitions. Second operand 12 states. [2019-11-20 03:50:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:30,797 INFO L93 Difference]: Finished difference Result 461 states and 606 transitions. [2019-11-20 03:50:30,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 03:50:30,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-11-20 03:50:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:30,800 INFO L225 Difference]: With dead ends: 461 [2019-11-20 03:50:30,800 INFO L226 Difference]: Without dead ends: 459 [2019-11-20 03:50:30,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=104, Invalid=234, Unknown=4, NotChecked=0, Total=342 [2019-11-20 03:50:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-20 03:50:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 257. [2019-11-20 03:50:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 03:50:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 341 transitions. [2019-11-20 03:50:30,823 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 341 transitions. Word has length 34 [2019-11-20 03:50:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:30,824 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 341 transitions. [2019-11-20 03:50:30,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:50:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 341 transitions. [2019-11-20 03:50:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 03:50:30,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:30,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:31,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:31,029 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:31,029 INFO L82 PathProgramCache]: Analyzing trace with hash 354754815, now seen corresponding path program 1 times [2019-11-20 03:50:31,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:31,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1534621033] [2019-11-20 03:50:31,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:31,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:50:31,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:31,132 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:31,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1534621033] [2019-11-20 03:50:31,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:31,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 03:50:31,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969139973] [2019-11-20 03:50:31,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:50:31,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:31,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:50:31,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:50:31,169 INFO L87 Difference]: Start difference. First operand 257 states and 341 transitions. Second operand 8 states. [2019-11-20 03:50:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:31,485 INFO L93 Difference]: Finished difference Result 402 states and 516 transitions. [2019-11-20 03:50:31,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:50:31,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-11-20 03:50:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:31,488 INFO L225 Difference]: With dead ends: 402 [2019-11-20 03:50:31,488 INFO L226 Difference]: Without dead ends: 359 [2019-11-20 03:50:31,488 INFO L630 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-20 03:50:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-20 03:50:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 257. [2019-11-20 03:50:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 03:50:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 340 transitions. [2019-11-20 03:50:31,507 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 340 transitions. Word has length 35 [2019-11-20 03:50:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:31,507 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 340 transitions. [2019-11-20 03:50:31,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:50:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 340 transitions. [2019-11-20 03:50:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 03:50:31,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:31,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:31,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:31,710 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:31,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1156444680, now seen corresponding path program 1 times [2019-11-20 03:50:31,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:31,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [817317663] [2019-11-20 03:50:31,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:31,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:50:31,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:31,832 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:31,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [817317663] [2019-11-20 03:50:31,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:31,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 03:50:31,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403503079] [2019-11-20 03:50:31,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:50:31,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:31,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:50:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:50:31,955 INFO L87 Difference]: Start difference. First operand 257 states and 340 transitions. Second operand 12 states. [2019-11-20 03:50:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:33,224 INFO L93 Difference]: Finished difference Result 650 states and 829 transitions. [2019-11-20 03:50:33,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 03:50:33,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-20 03:50:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:33,228 INFO L225 Difference]: With dead ends: 650 [2019-11-20 03:50:33,228 INFO L226 Difference]: Without dead ends: 623 [2019-11-20 03:50:33,229 INFO L630 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-20 03:50:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-11-20 03:50:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 336. [2019-11-20 03:50:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-20 03:50:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 441 transitions. [2019-11-20 03:50:33,265 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 441 transitions. Word has length 36 [2019-11-20 03:50:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:33,266 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 441 transitions. [2019-11-20 03:50:33,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:50:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 441 transitions. [2019-11-20 03:50:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 03:50:33,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:33,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:33,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:33,469 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:33,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1928546137, now seen corresponding path program 1 times [2019-11-20 03:50:33,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:33,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1880514086] [2019-11-20 03:50:33,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:33,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:50:33,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:33,535 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:33,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1880514086] [2019-11-20 03:50:33,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:33,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:50:33,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449531774] [2019-11-20 03:50:33,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:50:33,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:50:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:50:33,554 INFO L87 Difference]: Start difference. First operand 336 states and 441 transitions. Second operand 6 states. [2019-11-20 03:50:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:33,684 INFO L93 Difference]: Finished difference Result 473 states and 595 transitions. [2019-11-20 03:50:33,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:50:33,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-20 03:50:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:33,687 INFO L225 Difference]: With dead ends: 473 [2019-11-20 03:50:33,687 INFO L226 Difference]: Without dead ends: 455 [2019-11-20 03:50:33,688 INFO L630 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-20 03:50:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-20 03:50:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 336. [2019-11-20 03:50:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-20 03:50:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 440 transitions. [2019-11-20 03:50:33,719 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 440 transitions. Word has length 37 [2019-11-20 03:50:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:33,719 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 440 transitions. [2019-11-20 03:50:33,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:50:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 440 transitions. [2019-11-20 03:50:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 03:50:33,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:33,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:33,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:33,930 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash 485252236, now seen corresponding path program 1 times [2019-11-20 03:50:33,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:33,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1374927961] [2019-11-20 03:50:33,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:33,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:50:33,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:34,002 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:34,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1374927961] [2019-11-20 03:50:34,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:34,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 03:50:34,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856867449] [2019-11-20 03:50:34,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:50:34,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:50:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:50:34,006 INFO L87 Difference]: Start difference. First operand 336 states and 440 transitions. Second operand 4 states. [2019-11-20 03:50:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:34,050 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2019-11-20 03:50:34,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:50:34,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-20 03:50:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:34,052 INFO L225 Difference]: With dead ends: 342 [2019-11-20 03:50:34,052 INFO L226 Difference]: Without dead ends: 266 [2019-11-20 03:50:34,053 INFO L630 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-20 03:50:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-20 03:50:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 247. [2019-11-20 03:50:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-20 03:50:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 322 transitions. [2019-11-20 03:50:34,073 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 322 transitions. Word has length 38 [2019-11-20 03:50:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:34,073 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 322 transitions. [2019-11-20 03:50:34,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:50:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 322 transitions. [2019-11-20 03:50:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 03:50:34,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:34,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:34,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:34,276 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:34,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:34,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1053866834, now seen corresponding path program 1 times [2019-11-20 03:50:34,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:34,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1797990693] [2019-11-20 03:50:34,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:34,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:50:34,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:34,367 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:34,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1797990693] [2019-11-20 03:50:34,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:34,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 03:50:34,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434273645] [2019-11-20 03:50:34,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:50:34,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:50:34,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:50:34,500 INFO L87 Difference]: Start difference. First operand 247 states and 322 transitions. Second operand 12 states. [2019-11-20 03:50:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:35,534 INFO L93 Difference]: Finished difference Result 544 states and 666 transitions. [2019-11-20 03:50:35,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 03:50:35,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-20 03:50:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:35,537 INFO L225 Difference]: With dead ends: 544 [2019-11-20 03:50:35,537 INFO L226 Difference]: Without dead ends: 495 [2019-11-20 03:50:35,537 INFO L630 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-20 03:50:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-20 03:50:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 257. [2019-11-20 03:50:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 03:50:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 334 transitions. [2019-11-20 03:50:35,561 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 334 transitions. Word has length 38 [2019-11-20 03:50:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:35,562 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 334 transitions. [2019-11-20 03:50:35,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:50:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 334 transitions. [2019-11-20 03:50:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 03:50:35,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:35,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:35,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:35,765 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash -794681556, now seen corresponding path program 1 times [2019-11-20 03:50:35,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:35,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1321791918] [2019-11-20 03:50:35,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:35,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:50:35,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:35,870 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:35,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1321791918] [2019-11-20 03:50:35,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:35,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 03:50:35,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208711812] [2019-11-20 03:50:35,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:50:35,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:35,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:50:35,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:50:35,903 INFO L87 Difference]: Start difference. First operand 257 states and 334 transitions. Second operand 8 states. [2019-11-20 03:50:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:36,023 INFO L93 Difference]: Finished difference Result 287 states and 362 transitions. [2019-11-20 03:50:36,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:50:36,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-20 03:50:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:36,024 INFO L225 Difference]: With dead ends: 287 [2019-11-20 03:50:36,024 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 03:50:36,024 INFO L630 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-20 03:50:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 03:50:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 257. [2019-11-20 03:50:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 03:50:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 329 transitions. [2019-11-20 03:50:36,047 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 329 transitions. Word has length 40 [2019-11-20 03:50:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:36,048 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 329 transitions. [2019-11-20 03:50:36,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:50:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 329 transitions. [2019-11-20 03:50:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 03:50:36,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:36,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:36,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:36,251 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:36,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1171807129, now seen corresponding path program 1 times [2019-11-20 03:50:36,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:36,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [853901245] [2019-11-20 03:50:36,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:36,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 03:50:36,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:39,367 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:40,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:40,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [853901245] [2019-11-20 03:50:40,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:40,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-11-20 03:50:40,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697630220] [2019-11-20 03:50:40,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 03:50:40,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 03:50:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=388, Unknown=1, NotChecked=0, Total=462 [2019-11-20 03:50:40,659 INFO L87 Difference]: Start difference. First operand 257 states and 329 transitions. Second operand 22 states. [2019-11-20 03:50:41,335 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-20 03:50:42,371 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-20 03:50:43,058 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-20 03:50:43,864 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-20 03:50:44,347 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-20 03:50:45,519 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-20 03:50:46,397 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-20 03:50:47,457 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-20 03:50:51,026 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-11-20 03:50:51,470 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-11-20 03:50:51,798 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-20 03:50:52,214 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-11-20 03:50:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:52,390 INFO L93 Difference]: Finished difference Result 596 states and 718 transitions. [2019-11-20 03:50:52,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-20 03:50:52,391 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-11-20 03:50:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:52,394 INFO L225 Difference]: With dead ends: 596 [2019-11-20 03:50:52,394 INFO L226 Difference]: Without dead ends: 558 [2019-11-20 03:50:52,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=574, Invalid=2847, Unknown=1, NotChecked=0, Total=3422 [2019-11-20 03:50:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-11-20 03:50:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 306. [2019-11-20 03:50:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-20 03:50:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 387 transitions. [2019-11-20 03:50:52,434 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 387 transitions. Word has length 42 [2019-11-20 03:50:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:52,435 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 387 transitions. [2019-11-20 03:50:52,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 03:50:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 387 transitions. [2019-11-20 03:50:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:50:52,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:52,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:52,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:52,639 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:52,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash 967666444, now seen corresponding path program 1 times [2019-11-20 03:50:52,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:52,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1709170115] [2019-11-20 03:50:52,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:52,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 03:50:52,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:52,909 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:53,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1709170115] [2019-11-20 03:50:53,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:53,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 03:50:53,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754420773] [2019-11-20 03:50:53,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 03:50:53,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:53,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 03:50:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:50:53,071 INFO L87 Difference]: Start difference. First operand 306 states and 387 transitions. Second operand 14 states. [2019-11-20 03:50:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:55,161 INFO L93 Difference]: Finished difference Result 540 states and 648 transitions. [2019-11-20 03:50:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 03:50:55,162 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-11-20 03:50:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:55,164 INFO L225 Difference]: With dead ends: 540 [2019-11-20 03:50:55,164 INFO L226 Difference]: Without dead ends: 502 [2019-11-20 03:50:55,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2019-11-20 03:50:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-20 03:50:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 246. [2019-11-20 03:50:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-20 03:50:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 311 transitions. [2019-11-20 03:50:55,198 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 311 transitions. Word has length 43 [2019-11-20 03:50:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:55,198 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 311 transitions. [2019-11-20 03:50:55,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 03:50:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 311 transitions. [2019-11-20 03:50:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 03:50:55,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:55,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:55,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:55,402 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1590708502, now seen corresponding path program 1 times [2019-11-20 03:50:55,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:55,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1076004627] [2019-11-20 03:50:55,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:55,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:50:55,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:55,514 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:55,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1076004627] [2019-11-20 03:50:55,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:55,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 03:50:55,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923152523] [2019-11-20 03:50:55,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:50:55,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:55,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:50:55,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:50:55,543 INFO L87 Difference]: Start difference. First operand 246 states and 311 transitions. Second operand 8 states. [2019-11-20 03:50:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:55,668 INFO L93 Difference]: Finished difference Result 267 states and 331 transitions. [2019-11-20 03:50:55,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:50:55,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-20 03:50:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:55,670 INFO L225 Difference]: With dead ends: 267 [2019-11-20 03:50:55,670 INFO L226 Difference]: Without dead ends: 237 [2019-11-20 03:50:55,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-20 03:50:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-20 03:50:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2019-11-20 03:50:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-20 03:50:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 273 transitions. [2019-11-20 03:50:55,690 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 273 transitions. Word has length 45 [2019-11-20 03:50:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:55,690 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 273 transitions. [2019-11-20 03:50:55,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:50:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 273 transitions. [2019-11-20 03:50:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 03:50:55,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:55,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:55,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:55,891 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash 828894207, now seen corresponding path program 1 times [2019-11-20 03:50:55,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:55,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1442395110] [2019-11-20 03:50:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:55,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:50:55,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:55,980 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:56,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1442395110] [2019-11-20 03:50:56,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:56,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:50:56,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932461374] [2019-11-20 03:50:56,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:50:56,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:50:56,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:50:56,004 INFO L87 Difference]: Start difference. First operand 217 states and 273 transitions. Second operand 6 states. [2019-11-20 03:50:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:56,102 INFO L93 Difference]: Finished difference Result 276 states and 336 transitions. [2019-11-20 03:50:56,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:50:56,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-20 03:50:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:56,104 INFO L225 Difference]: With dead ends: 276 [2019-11-20 03:50:56,104 INFO L226 Difference]: Without dead ends: 255 [2019-11-20 03:50:56,105 INFO L630 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-20 03:50:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-20 03:50:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 217. [2019-11-20 03:50:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-20 03:50:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 266 transitions. [2019-11-20 03:50:56,145 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 266 transitions. Word has length 47 [2019-11-20 03:50:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:56,145 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 266 transitions. [2019-11-20 03:50:56,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:50:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 266 transitions. [2019-11-20 03:50:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 03:50:56,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:56,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:56,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:50:56,347 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:56,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1468214233, now seen corresponding path program 1 times [2019-11-20 03:50:56,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:50:56,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [777447085] [2019-11-20 03:50:56,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:50:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:56,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 03:50:56,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:58,812 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:50:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:50:59,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [777447085] [2019-11-20 03:50:59,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:59,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-20 03:50:59,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235446003] [2019-11-20 03:50:59,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 03:50:59,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:50:59,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 03:50:59,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=323, Unknown=1, NotChecked=0, Total=380 [2019-11-20 03:50:59,476 INFO L87 Difference]: Start difference. First operand 217 states and 266 transitions. Second operand 20 states. [2019-11-20 03:51:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:14,362 INFO L93 Difference]: Finished difference Result 460 states and 517 transitions. [2019-11-20 03:51:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-20 03:51:14,363 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-11-20 03:51:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:14,365 INFO L225 Difference]: With dead ends: 460 [2019-11-20 03:51:14,365 INFO L226 Difference]: Without dead ends: 432 [2019-11-20 03:51:14,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=320, Invalid=1748, Unknown=2, NotChecked=0, Total=2070 [2019-11-20 03:51:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-20 03:51:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 226. [2019-11-20 03:51:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-20 03:51:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2019-11-20 03:51:14,404 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 47 [2019-11-20 03:51:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:14,405 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2019-11-20 03:51:14,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 03:51:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2019-11-20 03:51:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 03:51:14,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:51:14,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:51:14,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:51:14,617 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:51:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:51:14,617 INFO L82 PathProgramCache]: Analyzing trace with hash 319421117, now seen corresponding path program 1 times [2019-11-20 03:51:14,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:51:14,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [753979041] [2019-11-20 03:51:14,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:51:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:51:14,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 03:51:14,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:51:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:14,710 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:51:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:14,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [753979041] [2019-11-20 03:51:14,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:51:14,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-20 03:51:14,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913435145] [2019-11-20 03:51:14,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:51:14,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:51:14,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:51:14,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:51:14,730 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand 8 states. [2019-11-20 03:51:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:14,974 INFO L93 Difference]: Finished difference Result 370 states and 438 transitions. [2019-11-20 03:51:14,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:51:14,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-20 03:51:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:14,976 INFO L225 Difference]: With dead ends: 370 [2019-11-20 03:51:14,976 INFO L226 Difference]: Without dead ends: 318 [2019-11-20 03:51:14,976 INFO L630 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-20 03:51:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-20 03:51:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 224. [2019-11-20 03:51:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-20 03:51:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 274 transitions. [2019-11-20 03:51:15,016 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 274 transitions. Word has length 47 [2019-11-20 03:51:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:15,017 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 274 transitions. [2019-11-20 03:51:15,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:51:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 274 transitions. [2019-11-20 03:51:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 03:51:15,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:51:15,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:51:15,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:51:15,220 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:51:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:51:15,221 INFO L82 PathProgramCache]: Analyzing trace with hash 783709332, now seen corresponding path program 1 times [2019-11-20 03:51:15,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:51:15,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2140447497] [2019-11-20 03:51:15,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:51:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:51:15,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:51:15,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:51:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:15,325 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:51:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:15,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2140447497] [2019-11-20 03:51:15,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:51:15,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-20 03:51:15,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113664425] [2019-11-20 03:51:15,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:51:15,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:51:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:51:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:51:15,395 INFO L87 Difference]: Start difference. First operand 224 states and 274 transitions. Second operand 7 states. [2019-11-20 03:51:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:15,639 INFO L93 Difference]: Finished difference Result 292 states and 342 transitions. [2019-11-20 03:51:15,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:51:15,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-11-20 03:51:15,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:15,641 INFO L225 Difference]: With dead ends: 292 [2019-11-20 03:51:15,641 INFO L226 Difference]: Without dead ends: 274 [2019-11-20 03:51:15,641 INFO L630 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-20 03:51:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-20 03:51:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 162. [2019-11-20 03:51:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-20 03:51:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2019-11-20 03:51:15,661 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 48 [2019-11-20 03:51:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:15,661 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2019-11-20 03:51:15,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:51:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2019-11-20 03:51:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 03:51:15,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:51:15,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:51:15,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:51:15,863 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:51:15,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:51:15,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1897706261, now seen corresponding path program 1 times [2019-11-20 03:51:15,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:51:15,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1669256732] [2019-11-20 03:51:15,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:51:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:51:15,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:51:15,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:51:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:15,921 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:51:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:15,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1669256732] [2019-11-20 03:51:15,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:51:15,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 03:51:15,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631952093] [2019-11-20 03:51:15,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:51:15,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:51:15,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:51:15,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:51:15,924 INFO L87 Difference]: Start difference. First operand 162 states and 203 transitions. Second operand 3 states. [2019-11-20 03:51:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:15,968 INFO L93 Difference]: Finished difference Result 247 states and 302 transitions. [2019-11-20 03:51:15,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:51:15,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-20 03:51:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:15,970 INFO L225 Difference]: With dead ends: 247 [2019-11-20 03:51:15,970 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 03:51:15,971 INFO L630 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-20 03:51:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 03:51:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-20 03:51:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 03:51:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2019-11-20 03:51:15,984 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 48 [2019-11-20 03:51:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:15,984 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2019-11-20 03:51:15,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:51:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2019-11-20 03:51:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 03:51:15,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:51:15,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:51:16,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:51:16,186 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:51:16,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:51:16,186 INFO L82 PathProgramCache]: Analyzing trace with hash 994748235, now seen corresponding path program 1 times [2019-11-20 03:51:16,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:51:16,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1187695995] [2019-11-20 03:51:16,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:51:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:51:16,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:51:16,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:51:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:16,258 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:51:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:16,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1187695995] [2019-11-20 03:51:16,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:51:16,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 03:51:16,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879766751] [2019-11-20 03:51:16,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:51:16,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:51:16,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:51:16,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:51:16,274 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 7 states. [2019-11-20 03:51:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:16,325 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2019-11-20 03:51:16,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:51:16,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-11-20 03:51:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:16,326 INFO L225 Difference]: With dead ends: 103 [2019-11-20 03:51:16,326 INFO L226 Difference]: Without dead ends: 61 [2019-11-20 03:51:16,326 INFO L630 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-20 03:51:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-20 03:51:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-20 03:51:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 03:51:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-11-20 03:51:16,332 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 49 [2019-11-20 03:51:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:16,332 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-11-20 03:51:16,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:51:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-11-20 03:51:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 03:51:16,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:51:16,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:51:16,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:51:16,538 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:51:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:51:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1511004533, now seen corresponding path program 1 times [2019-11-20 03:51:16,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:51:16,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [784293835] [2019-11-20 03:51:16,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/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-20 03:51:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:51:16,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:51:16,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:51:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:16,635 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:51:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:51:16,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [784293835] [2019-11-20 03:51:16,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:51:16,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-20 03:51:16,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688490810] [2019-11-20 03:51:16,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:51:16,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:51:16,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:51:16,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:51:16,653 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 7 states. [2019-11-20 03:51:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:16,721 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-11-20 03:51:16,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:51:16,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-11-20 03:51:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:16,722 INFO L225 Difference]: With dead ends: 61 [2019-11-20 03:51:16,722 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:51:16,722 INFO L630 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-20 03:51:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:51:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:51:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:51:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:51:16,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-11-20 03:51:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:16,723 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:51:16,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:51:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:51:16,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:51:16,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:51:16,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:51:17,153 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 168 [2019-11-20 03:51:17,734 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 378 [2019-11-20 03:51:18,214 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 449 DAG size of output: 380 [2019-11-20 03:51:18,463 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 409 DAG size of output: 362 [2019-11-20 03:51:18,769 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 208 [2019-11-20 03:51:19,466 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 544 DAG size of output: 480 [2019-11-20 03:51:20,897 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 168 DAG size of output: 70 [2019-11-20 03:51:37,516 WARN L191 SmtUtils]: Spent 16.60 s on a formula simplification. DAG size of input: 372 DAG size of output: 163 [2019-11-20 03:52:01,119 WARN L191 SmtUtils]: Spent 23.59 s on a formula simplification. DAG size of input: 377 DAG size of output: 172 [2019-11-20 03:52:49,380 WARN L191 SmtUtils]: Spent 48.25 s on a formula simplification. DAG size of input: 358 DAG size of output: 185 [2019-11-20 03:52:54,797 WARN L191 SmtUtils]: Spent 5.41 s on a formula simplification. DAG size of input: 202 DAG size of output: 51 [2019-11-20 03:54:25,611 WARN L191 SmtUtils]: Spent 1.51 m on a formula simplification. DAG size of input: 475 DAG size of output: 173 [2019-11-20 03:54:32,763 WARN L191 SmtUtils]: Spent 7.15 s on a formula simplification. DAG size of input: 219 DAG size of output: 139 [2019-11-20 03:54:32,775 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,775 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 123) no Hoare annotation was computed. [2019-11-20 03:54:32,775 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-11-20 03:54:32,775 INFO L444 ceAbstractionStarter]: For program point L85-2(lines 84 137) no Hoare annotation was computed. [2019-11-20 03:54:32,776 INFO L440 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-20 03:54:32,776 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:54:32,776 INFO L444 ceAbstractionStarter]: For program point L284-1(lines 284 293) no Hoare annotation was computed. [2019-11-20 03:54:32,776 INFO L444 ceAbstractionStarter]: For program point L20(lines 20 25) no Hoare annotation was computed. [2019-11-20 03:54:32,776 INFO L444 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-11-20 03:54:32,776 INFO L444 ceAbstractionStarter]: For program point L20-2(lines 20 25) no Hoare annotation was computed. [2019-11-20 03:54:32,777 INFO L440 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-20 03:54:32,777 INFO L440 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-20 03:54:32,777 INFO L440 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-20 03:54:32,777 INFO L440 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-20 03:54:32,777 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 302) no Hoare annotation was computed. [2019-11-20 03:54:32,778 INFO L440 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-20 03:54:32,778 INFO L440 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-20 03:54:32,778 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-11-20 03:54:32,778 INFO L440 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-20 03:54:32,778 INFO L440 ceAbstractionStarter]: At program point L38-1(lines 28 43) the Hoare annotation is: false [2019-11-20 03:54:32,778 INFO L440 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-20 03:54:32,778 INFO L444 ceAbstractionStarter]: For program point L38-2(lines 38 42) no Hoare annotation was computed. [2019-11-20 03:54:32,779 INFO L440 ceAbstractionStarter]: At program point L38-3(lines 28 43) the Hoare annotation is: (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) [2019-11-20 03:54:32,779 INFO L444 ceAbstractionStarter]: For program point L38-4(lines 38 42) no Hoare annotation was computed. [2019-11-20 03:54:32,779 INFO L440 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-20 03:54:32,779 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 299) no Hoare annotation was computed. [2019-11-20 03:54:32,779 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 291) no Hoare annotation was computed. [2019-11-20 03:54:32,779 INFO L444 ceAbstractionStarter]: For program point L287-2(lines 287 291) no Hoare annotation was computed. [2019-11-20 03:54:32,779 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 280) no Hoare annotation was computed. [2019-11-20 03:54:32,779 INFO L444 ceAbstractionStarter]: For program point L271-2(lines 271 280) no Hoare annotation was computed. [2019-11-20 03:54:32,779 INFO L444 ceAbstractionStarter]: For program point L7(lines 7 9) no Hoare annotation was computed. [2019-11-20 03:54:32,780 INFO L440 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-20 03:54:32,780 INFO L444 ceAbstractionStarter]: For program point L7-3(lines 7 9) no Hoare annotation was computed. [2019-11-20 03:54:32,781 INFO L440 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-20 03:54:32,781 INFO L444 ceAbstractionStarter]: For program point L7-6(lines 7 9) no Hoare annotation was computed. [2019-11-20 03:54:32,781 INFO L444 ceAbstractionStarter]: For program point L321(lines 321 330) no Hoare annotation was computed. [2019-11-20 03:54:32,782 INFO L440 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-20 03:54:32,782 INFO L444 ceAbstractionStarter]: For program point L321-2(lines 320 336) no Hoare annotation was computed. [2019-11-20 03:54:32,782 INFO L444 ceAbstractionStarter]: For program point L7-9(lines 7 9) no Hoare annotation was computed. [2019-11-20 03:54:32,782 INFO L444 ceAbstractionStarter]: For program point L7-12(lines 7 9) no Hoare annotation was computed. [2019-11-20 03:54:32,782 INFO L444 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point L8-3(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point L8-4(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point L256-1(lines 256 265) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 342) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L447 ceAbstractionStarter]: At program point L306-1(lines 306 342) the Hoare annotation is: true [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 66) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 66) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point L26-2(lines 26 66) no Hoare annotation was computed. [2019-11-20 03:54:32,783 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L440 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-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point L274(lines 274 278) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point L274-2(lines 274 278) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point L324-2(lines 324 328) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point L308-1(lines 306 340) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 263) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point L259-2(lines 259 263) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:54:32,784 INFO L444 ceAbstractionStarter]: For program point L29(lines 28 43) no Hoare annotation was computed. [2019-11-20 03:54:32,785 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 28 43) no Hoare annotation was computed. [2019-11-20 03:54:32,785 INFO L444 ceAbstractionStarter]: For program point L29-2(lines 28 43) no Hoare annotation was computed. [2019-11-20 03:54:32,785 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,785 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 315) no Hoare annotation was computed. [2019-11-20 03:54:32,785 INFO L444 ceAbstractionStarter]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2019-11-20 03:54:32,785 INFO L440 ceAbstractionStarter]: At program point L64(lines 26 66) the Hoare annotation is: false [2019-11-20 03:54:32,785 INFO L440 ceAbstractionStarter]: At program point L64-1(lines 26 66) the Hoare annotation is: (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) [2019-11-20 03:54:32,786 INFO L440 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-20 03:54:32,786 INFO L447 ceAbstractionStarter]: At program point L345(lines 216 347) the Hoare annotation is: true [2019-11-20 03:54:32,786 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 255) no Hoare annotation was computed. [2019-11-20 03:54:32,786 INFO L444 ceAbstractionStarter]: For program point L246-2(lines 240 346) no Hoare annotation was computed. [2019-11-20 03:54:32,786 INFO L440 ceAbstractionStarter]: At program point L48-2(lines 48 63) the Hoare annotation is: false [2019-11-20 03:54:32,786 INFO L440 ceAbstractionStarter]: At program point L48-5(lines 48 63) the Hoare annotation is: (= ULTIMATE.start_main_~zero~0 (_ bv0 32)) [2019-11-20 03:54:32,786 INFO L440 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-20 03:54:32,786 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-20 03:54:32,786 INFO L444 ceAbstractionStarter]: For program point L49(lines 48 63) no Hoare annotation was computed. [2019-11-20 03:54:32,786 INFO L444 ceAbstractionStarter]: For program point L49-1(lines 48 63) no Hoare annotation was computed. [2019-11-20 03:54:32,786 INFO L444 ceAbstractionStarter]: For program point L49-2(lines 48 63) no Hoare annotation was computed. [2019-11-20 03:54:32,786 INFO L444 ceAbstractionStarter]: For program point L50(lines 48 63) no Hoare annotation was computed. [2019-11-20 03:54:32,786 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 48 63) no Hoare annotation was computed. [2019-11-20 03:54:32,786 INFO L444 ceAbstractionStarter]: For program point L50-2(lines 48 63) no Hoare annotation was computed. [2019-11-20 03:54:32,787 INFO L444 ceAbstractionStarter]: For program point L331-1(lines 318 336) no Hoare annotation was computed. [2019-11-20 03:54:32,787 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 253) no Hoare annotation was computed. [2019-11-20 03:54:32,787 INFO L444 ceAbstractionStarter]: For program point L249-2(lines 249 253) no Hoare annotation was computed. [2019-11-20 03:54:32,787 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 128) no Hoare annotation was computed. [2019-11-20 03:54:32,787 INFO L444 ceAbstractionStarter]: For program point L117-2(lines 117 128) no Hoare annotation was computed. [2019-11-20 03:54:32,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:32,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:32,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:32,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:32,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:32,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:32,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:32,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:32,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:32,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:32,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:32,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:54:32 BoogieIcfgContainer [2019-11-20 03:54:32,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:54:32,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:54:32,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:54:32,974 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:54:32,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:50:04" (3/4) ... [2019-11-20 03:54:32,979 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:54:32,996 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-20 03:54:32,997 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-20 03:54:33,030 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0bv32 == __retres4 && m == 0bv32) && \result == 0bv32 [2019-11-20 03:54:33,031 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: zero == 0bv32 || (0bv32 == __retres4 && \result == 0bv32) [2019-11-20 03:54:33,032 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0bv32 == a || zero == 0bv32) || (0bv32 == __retres4 && \result == 0bv32) [2019-11-20 03:54:33,033 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-20 03:54:33,034 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-20 03:54:33,034 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-20 03:54:33,035 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-20 03:54:33,035 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-20 03:54:33,036 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-20 03:54:33,037 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-20 03:54:33,074 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6904c259-a76d-4304-b12a-f24b45721679/bin/uautomizer/witness.graphml [2019-11-20 03:54:33,075 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:54:33,076 INFO L168 Benchmark]: Toolchain (without parser) took 269493.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 949.7 MB in the beginning and 815.0 MB in the end (delta: 134.7 MB). Peak memory consumption was 429.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:33,076 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:54:33,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:33,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:54:33,078 INFO L168 Benchmark]: Boogie Preprocessor took 42.23 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-20 03:54:33,078 INFO L168 Benchmark]: RCFGBuilder took 569.54 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:33,079 INFO L168 Benchmark]: TraceAbstraction took 268250.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 824.6 MB in the end (delta: 266.4 MB). Peak memory consumption was 473.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:33,079 INFO L168 Benchmark]: Witness Printer took 100.86 ms. Allocated memory is still 1.3 GB. Free memory was 824.6 MB in the beginning and 815.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:33,081 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 481.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.12 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 42.23 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 569.54 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 268250.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 824.6 MB in the end (delta: 266.4 MB). Peak memory consumption was 473.4 MB. Max. memory is 11.5 GB. * Witness Printer took 100.86 ms. Allocated memory is still 1.3 GB. Free memory was 824.6 MB in the beginning and 815.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 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-20 03:54:33,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,115 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-20 03:54:33,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,154 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-20 03:54:33,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,176 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-20 03:54:33,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,215 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-20 03:54:33,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,223 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-20 03:54:33,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,245 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-20 03:54:33,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:33,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:33,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:33,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~a,QUANTIFIED] [2019-11-20 03:54:33,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~b,QUANTIFIED] [2019-11-20 03:54:33,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~delta~0,QUANTIFIED] [2019-11-20 03:54:33,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_addflt_~ma~0,QUANTIFIED] [2019-11-20 03:54:33,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~zero~0,QUANTIFIED] [2019-11-20 03:54:33,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:33,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_addflt_~delta~0_24,QUANTIFIED] [2019-11-20 03:54:33,269 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: 268.0s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 51.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 195.8s, HoareTripleCheckerStatistics: 3759 SDtfs, 9989 SDslu, 15678 SDs, 0 SdLazy, 4557 SolverSat, 337 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 25.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2186 GetRequests, 1804 SyntacticMatches, 14 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 34.2s 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.5s HoareSimplificationTime, 24 FomulaSimplificationsInter, 2871233186 FormulaSimplificationTreeSizeReductionInter, 193.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.6s 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...