./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/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 4284cb37841cd94fe17da64cc250a8a1e69c6375 ...................................................................................................................................................................................................................................................................................................................................................................... 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_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/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 4284cb37841cd94fe17da64cc250a8a1e69c6375 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:12:28,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:12:28,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:12:28,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:12:28,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:12:28,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:12:28,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:12:28,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:12:28,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:12:28,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:12:28,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:12:28,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:12:28,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:12:28,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:12:28,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:12:28,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:12:28,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:12:28,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:12:28,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:12:28,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:12:28,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:12:28,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:12:28,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:12:28,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:12:28,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:12:28,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:12:28,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:12:28,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:12:28,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:12:28,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:12:28,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:12:28,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:12:28,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:12:28,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:12:28,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:12:28,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:12:28,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:12:28,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:12:28,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:12:28,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:12:28,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:12:28,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:12:28,955 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:12:28,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:12:28,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:12:28,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:12:28,957 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:12:28,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:12:28,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:12:28,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:12:28,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:12:28,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:12:28,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:12:28,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:12:28,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:12:28,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:12:28,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:12:28,960 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:12:28,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:12:28,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:12:28,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:12:28,961 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:12:28,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:12:28,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:12:28,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:12:28,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:12:28,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:12:28,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:12:28,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:12:28,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:12:28,963 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_7a029392-eeb5-45e2-8c9c-fcd92e713896/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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-15 23:12:28,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:12:29,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:12:29,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:12:29,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:12:29,005 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:12:29,006 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-15 23:12:29,058 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data/e7dbbf7f9/f21167be84c34a058e377d703b56e9f2/FLAG03a947575 [2019-11-15 23:12:29,456 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:12:29,458 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-15 23:12:29,466 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data/e7dbbf7f9/f21167be84c34a058e377d703b56e9f2/FLAG03a947575 [2019-11-15 23:12:29,774 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data/e7dbbf7f9/f21167be84c34a058e377d703b56e9f2 [2019-11-15 23:12:29,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:12:29,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:12:29,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:29,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:12:29,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:12:29,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:29" (1/1) ... [2019-11-15 23:12:29,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33934ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:29, skipping insertion in model container [2019-11-15 23:12:29,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:29" (1/1) ... [2019-11-15 23:12:29,796 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:12:29,822 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:12:30,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:30,119 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:12:30,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:30,168 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:12:30,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30 WrapperNode [2019-11-15 23:12:30,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:30,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:30,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:12:30,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:12:30,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... [2019-11-15 23:12:30,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... [2019-11-15 23:12:30,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:30,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:12:30,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:12:30,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:12:30,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... [2019-11-15 23:12:30,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... [2019-11-15 23:12:30,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... [2019-11-15 23:12:30,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... [2019-11-15 23:12:30,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... [2019-11-15 23:12:30,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... [2019-11-15 23:12:30,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... [2019-11-15 23:12:30,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:12:30,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:12:30,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:12:30,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:12:30,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:12:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:12:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 23:12:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:12:30,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:12:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:12:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:12:30,630 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:12:30,630 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-15 23:12:30,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:30 BoogieIcfgContainer [2019-11-15 23:12:30,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:12:30,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:12:30,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:12:30,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:12:30,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:12:29" (1/3) ... [2019-11-15 23:12:30,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a01255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:12:30, skipping insertion in model container [2019-11-15 23:12:30,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:30" (2/3) ... [2019-11-15 23:12:30,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a01255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:12:30, skipping insertion in model container [2019-11-15 23:12:30,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:30" (3/3) ... [2019-11-15 23:12:30,639 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-15 23:12:30,648 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:12:30,654 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:12:30,673 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:12:30,696 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:12:30,696 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:12:30,696 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:12:30,697 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:12:30,697 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:12:30,697 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:12:30,697 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:12:30,697 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:12:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-15 23:12:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:12:30,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:30,716 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:30,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:30,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:30,723 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-15 23:12:30,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:30,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593784235] [2019-11-15 23:12:30,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:30,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:30,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:30,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593784235] [2019-11-15 23:12:30,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:30,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:12:30,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185713367] [2019-11-15 23:12:30,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:12:30,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:30,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:12:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:12:30,847 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-15 23:12:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:30,869 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-15 23:12:30,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:12:30,870 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 23:12:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:30,879 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:12:30,879 INFO L226 Difference]: Without dead ends: 29 [2019-11-15 23:12:30,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:12:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-15 23:12:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-15 23:12:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 23:12:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-15 23:12:30,912 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-15 23:12:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:30,912 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-15 23:12:30,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:12:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-15 23:12:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:12:30,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:30,913 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:30,914 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-15 23:12:30,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:30,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126816224] [2019-11-15 23:12:30,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:30,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:30,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:31,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126816224] [2019-11-15 23:12:31,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:31,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:12:31,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354175180] [2019-11-15 23:12:31,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:12:31,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:12:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:12:31,003 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-15 23:12:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:31,097 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-15 23:12:31,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:12:31,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 23:12:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:31,099 INFO L225 Difference]: With dead ends: 53 [2019-11-15 23:12:31,099 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 23:12:31,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:12:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 23:12:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-15 23:12:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 23:12:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-15 23:12:31,107 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-15 23:12:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:31,110 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-15 23:12:31,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:12:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-15 23:12:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:12:31,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:31,112 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:31,112 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:31,113 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-15 23:12:31,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:31,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126673518] [2019-11-15 23:12:31,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:31,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:31,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:31,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126673518] [2019-11-15 23:12:31,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:31,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:12:31,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397317409] [2019-11-15 23:12:31,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:12:31,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:31,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:12:31,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:12:31,204 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-15 23:12:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:31,266 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-15 23:12:31,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:12:31,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-15 23:12:31,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:31,269 INFO L225 Difference]: With dead ends: 55 [2019-11-15 23:12:31,269 INFO L226 Difference]: Without dead ends: 46 [2019-11-15 23:12:31,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:12:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-15 23:12:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-15 23:12:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 23:12:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-15 23:12:31,285 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-15 23:12:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:31,285 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-15 23:12:31,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:12:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-15 23:12:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:12:31,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:31,288 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:31,288 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:31,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:31,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-15 23:12:31,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:31,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476257225] [2019-11-15 23:12:31,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:31,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:31,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:31,381 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:31,381 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:12:31,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:12:31 BoogieIcfgContainer [2019-11-15 23:12:31,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:12:31,411 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:12:31,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:12:31,411 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:12:31,412 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:30" (3/4) ... [2019-11-15 23:12:31,415 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:12:31,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:12:31,421 INFO L168 Benchmark]: Toolchain (without parser) took 1641.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -101.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:31,422 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:31,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:31,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:31,426 INFO L168 Benchmark]: Boogie Preprocessor took 37.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:31,427 INFO L168 Benchmark]: RCFGBuilder took 371.34 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:31,428 INFO L168 Benchmark]: TraceAbstraction took 778.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:31,428 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:31,431 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 389.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.47 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 371.34 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 778.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 75. Possible FailurePath: [L74] double x = 0.0; [L75] double y = -0.0; [L19] __uint32_t msw, lsw; [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:12:33,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:12:33,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:12:33,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:12:33,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:12:33,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:12:33,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:12:33,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:12:33,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:12:33,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:12:33,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:12:33,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:12:33,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:12:33,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:12:33,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:12:33,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:12:33,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:12:33,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:12:33,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:12:33,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:12:33,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:12:33,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:12:33,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:12:33,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:12:33,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:12:33,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:12:33,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:12:33,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:12:33,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:12:33,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:12:33,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:12:33,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:12:33,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:12:33,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:12:33,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:12:33,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:12:33,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:12:33,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:12:33,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:12:33,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:12:33,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:12:33,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:12:33,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:12:33,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:12:33,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:12:33,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:12:33,804 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:12:33,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:12:33,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:12:33,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:12:33,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:12:33,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:12:33,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:12:33,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:12:33,805 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:12:33,806 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:12:33,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:12:33,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:12:33,806 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:12:33,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:12:33,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:12:33,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:12:33,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:12:33,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:12:33,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:12:33,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:12:33,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:12:33,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:12:33,809 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:12:33,809 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:12:33,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:12:33,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:12:33,810 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_7a029392-eeb5-45e2-8c9c-fcd92e713896/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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-15 23:12:33,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:12:33,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:12:33,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:12:33,856 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:12:33,856 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:12:33,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-15 23:12:33,914 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data/7c00c4292/4bca1bc39b484b7c9735f56942730cfb/FLAGd56a442b1 [2019-11-15 23:12:34,359 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:12:34,361 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-15 23:12:34,368 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data/7c00c4292/4bca1bc39b484b7c9735f56942730cfb/FLAGd56a442b1 [2019-11-15 23:12:34,746 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/data/7c00c4292/4bca1bc39b484b7c9735f56942730cfb [2019-11-15 23:12:34,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:12:34,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:12:34,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:34,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:12:34,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:12:34,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374c534b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34, skipping insertion in model container [2019-11-15 23:12:34,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,765 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:12:34,782 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:12:34,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:34,968 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:12:34,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:35,095 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:12:35,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35 WrapperNode [2019-11-15 23:12:35,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:35,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:35,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:12:35,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:12:35,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... [2019-11-15 23:12:35,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... [2019-11-15 23:12:35,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:35,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:12:35,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:12:35,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:12:35,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... [2019-11-15 23:12:35,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... [2019-11-15 23:12:35,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... [2019-11-15 23:12:35,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... [2019-11-15 23:12:35,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... [2019-11-15 23:12:35,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... [2019-11-15 23:12:35,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... [2019-11-15 23:12:35,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:12:35,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:12:35,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:12:35,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:12:35,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:12:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-15 23:12:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:12:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:12:35,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:12:35,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:12:35,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:12:35,714 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:12:35,714 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-15 23:12:35,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:35 BoogieIcfgContainer [2019-11-15 23:12:35,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:12:35,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:12:35,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:12:35,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:12:35,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:12:34" (1/3) ... [2019-11-15 23:12:35,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76171202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:12:35, skipping insertion in model container [2019-11-15 23:12:35,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:35" (2/3) ... [2019-11-15 23:12:35,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76171202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:12:35, skipping insertion in model container [2019-11-15 23:12:35,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:35" (3/3) ... [2019-11-15 23:12:35,724 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-15 23:12:35,732 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:12:35,738 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:12:35,746 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:12:35,765 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:12:35,765 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:12:35,765 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:12:35,765 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:12:35,765 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:12:35,766 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:12:35,766 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:12:35,766 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:12:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-15 23:12:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:12:35,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:35,786 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:35,787 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:35,793 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-15 23:12:35,803 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:12:35,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616050622] [2019-11-15 23:12:35,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-15 23:12:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:35,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 23:12:35,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:35,901 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:12:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:35,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616050622] [2019-11-15 23:12:35,906 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:35,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:12:35,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960394264] [2019-11-15 23:12:35,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:12:35,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:12:35,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:12:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:12:35,922 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-15 23:12:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:35,941 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-15 23:12:35,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:12:35,943 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 23:12:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:35,953 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:12:35,954 INFO L226 Difference]: Without dead ends: 29 [2019-11-15 23:12:35,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:12:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-15 23:12:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-15 23:12:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 23:12:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-15 23:12:35,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-15 23:12:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:35,987 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-15 23:12:35,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:12:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-15 23:12:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:12:35,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:35,988 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:36,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 23:12:36,202 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-15 23:12:36,203 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:12:36,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370835861] [2019-11-15 23:12:36,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-15 23:12:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:36,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:12:36,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:36,332 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:12:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:36,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370835861] [2019-11-15 23:12:36,373 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:36,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 23:12:36,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636172689] [2019-11-15 23:12:36,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:36,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:12:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:12:36,376 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-15 23:12:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:36,640 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-15 23:12:36,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:12:36,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-15 23:12:36,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:36,642 INFO L225 Difference]: With dead ends: 68 [2019-11-15 23:12:36,642 INFO L226 Difference]: Without dead ends: 59 [2019-11-15 23:12:36,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:12:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-15 23:12:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-15 23:12:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 23:12:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-15 23:12:36,651 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-15 23:12:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:36,651 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-15 23:12:36,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-15 23:12:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:12:36,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:36,653 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:36,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 23:12:36,867 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:36,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-15 23:12:36,868 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:12:36,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645035871] [2019-11-15 23:12:36,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-15 23:12:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:36,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:12:36,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:36,999 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:12:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:37,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645035871] [2019-11-15 23:12:37,043 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:37,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 23:12:37,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828167575] [2019-11-15 23:12:37,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:37,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:12:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:37,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:12:37,045 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-15 23:12:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:37,141 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-15 23:12:37,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:12:37,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 23:12:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:37,144 INFO L225 Difference]: With dead ends: 52 [2019-11-15 23:12:37,144 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 23:12:37,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-15 23:12:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 23:12:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-15 23:12:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:12:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-15 23:12:37,149 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-15 23:12:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:37,150 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 23:12:37,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-15 23:12:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:12:37,152 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:37,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:37,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 23:12:37,367 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-15 23:12:37,368 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:12:37,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367672470] [2019-11-15 23:12:37,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-15 23:12:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:37,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:12:37,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:37,504 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:12:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:37,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367672470] [2019-11-15 23:12:37,523 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:37,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 23:12:37,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935877725] [2019-11-15 23:12:37,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:37,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:12:37,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:37,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:12:37,525 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-15 23:12:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:37,625 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-15 23:12:37,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:12:37,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-15 23:12:37,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:37,627 INFO L225 Difference]: With dead ends: 65 [2019-11-15 23:12:37,627 INFO L226 Difference]: Without dead ends: 56 [2019-11-15 23:12:37,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:12:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-15 23:12:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-15 23:12:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:12:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-15 23:12:37,633 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-15 23:12:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:37,634 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-15 23:12:37,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-15 23:12:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:12:37,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:37,635 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:37,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 23:12:37,855 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-15 23:12:37,856 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:12:37,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185728597] [2019-11-15 23:12:37,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-15 23:12:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:37,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:12:37,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:38,016 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:12:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:38,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185728597] [2019-11-15 23:12:38,073 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:38,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:12:38,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872592713] [2019-11-15 23:12:38,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:12:38,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:12:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:12:38,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:12:38,075 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-15 23:12:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:38,098 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-15 23:12:38,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:38,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-15 23:12:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:38,100 INFO L225 Difference]: With dead ends: 40 [2019-11-15 23:12:38,100 INFO L226 Difference]: Without dead ends: 30 [2019-11-15 23:12:38,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:12:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-15 23:12:38,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-15 23:12:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:12:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-15 23:12:38,108 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-15 23:12:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:38,108 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-15 23:12:38,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:12:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-15 23:12:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:12:38,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:38,110 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:38,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 23:12:38,327 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:38,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:38,327 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-15 23:12:38,328 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:12:38,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111564719] [2019-11-15 23:12:38,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-15 23:12:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:38,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:12:38,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:38,516 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:12:38,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:38,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111564719] [2019-11-15 23:12:38,620 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:38,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-15 23:12:38,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556679411] [2019-11-15 23:12:38,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:12:38,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:12:38,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:12:38,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:12:38,622 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-15 23:12:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:38,766 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-15 23:12:38,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:12:38,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-15 23:12:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:38,768 INFO L225 Difference]: With dead ends: 42 [2019-11-15 23:12:38,768 INFO L226 Difference]: Without dead ends: 39 [2019-11-15 23:12:38,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:12:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-15 23:12:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-15 23:12:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 23:12:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-15 23:12:38,773 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-15 23:12:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:38,773 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-15 23:12:38,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:12:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-15 23:12:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:12:38,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:38,774 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:38,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 23:12:38,984 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:38,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-15 23:12:38,985 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:12:38,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329104045] [2019-11-15 23:12:38,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-15 23:12:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:39,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:12:39,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:39,133 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:12:39,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:39,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329104045] [2019-11-15 23:12:39,243 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:39,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-15 23:12:39,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471932802] [2019-11-15 23:12:39,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:12:39,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:12:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:12:39,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:12:39,245 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-15 23:12:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:39,393 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-15 23:12:39,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:12:39,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 23:12:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:39,395 INFO L225 Difference]: With dead ends: 45 [2019-11-15 23:12:39,395 INFO L226 Difference]: Without dead ends: 27 [2019-11-15 23:12:39,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:12:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-15 23:12:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 23:12:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 23:12:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-15 23:12:39,400 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-15 23:12:39,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:39,401 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-15 23:12:39,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:12:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-15 23:12:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:12:39,402 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:39,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:39,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-15 23:12:39,603 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-15 23:12:39,604 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:12:39,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871866940] [2019-11-15 23:12:39,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-15 23:12:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:39,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:12:39,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:39,831 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:12:39,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:40,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871866940] [2019-11-15 23:12:40,092 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:40,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-15 23:12:40,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021778820] [2019-11-15 23:12:40,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:12:40,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:12:40,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:12:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:12:40,093 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-15 23:12:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:40,366 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-15 23:12:40,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:12:40,368 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-15 23:12:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:40,368 INFO L225 Difference]: With dead ends: 27 [2019-11-15 23:12:40,368 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:12:40,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:12:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:12:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:12:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:12:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:12:40,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-15 23:12:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:40,370 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:12:40,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:12:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:12:40,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:12:40,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-15 23:12:40,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:12:40,865 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-11-15 23:12:41,031 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:12:41,031 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:12:41,031 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2019-11-15 23:12:41,032 INFO L439 ceAbstractionStarter]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-15 23:12:41,032 INFO L443 ceAbstractionStarter]: For program point L21-3(lines 18 43) no Hoare annotation was computed. [2019-11-15 23:12:41,032 INFO L443 ceAbstractionStarter]: For program point L21-5(lines 21 26) no Hoare annotation was computed. [2019-11-15 23:12:41,032 INFO L439 ceAbstractionStarter]: At program point L21-6(lines 21 26) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-15 23:12:41,032 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 23:12:41,032 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2019-11-15 23:12:41,033 INFO L443 ceAbstractionStarter]: For program point L21-7(lines 18 43) no Hoare annotation was computed. [2019-11-15 23:12:41,033 INFO L443 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-11-15 23:12:41,033 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-11-15 23:12:41,033 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2019-11-15 23:12:41,033 INFO L439 ceAbstractionStarter]: At program point L63(lines 54 64) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3)) (fp.neg (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-15 23:12:41,034 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-15 23:12:41,034 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 42) no Hoare annotation was computed. [2019-11-15 23:12:41,034 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 42) no Hoare annotation was computed. [2019-11-15 23:12:41,034 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 49) no Hoare annotation was computed. [2019-11-15 23:12:41,034 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:12:41,034 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2019-11-15 23:12:41,035 INFO L439 ceAbstractionStarter]: At program point L57-2(lines 57 61) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___fpclassify_double_~x .cse0) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-15 23:12:41,035 INFO L443 ceAbstractionStarter]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2019-11-15 23:12:41,035 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:12:41,035 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-15 23:12:41,035 INFO L439 ceAbstractionStarter]: At program point L42(lines 18 43) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-15 23:12:41,036 INFO L439 ceAbstractionStarter]: At program point L42-1(lines 18 43) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-15 23:12:41,036 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-15 23:12:41,036 INFO L443 ceAbstractionStarter]: For program point L34-1(lines 34 42) no Hoare annotation was computed. [2019-11-15 23:12:41,036 INFO L446 ceAbstractionStarter]: At program point L84(lines 66 85) the Hoare annotation is: true [2019-11-15 23:12:41,036 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 23:12:41,036 INFO L443 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-11-15 23:12:41,054 INFO L439 ceAbstractionStarter]: At program point L51-3(lines 45 52) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-15 23:12:41,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:12:41 BoogieIcfgContainer [2019-11-15 23:12:41,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:12:41,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:12:41,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:12:41,087 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:12:41,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:35" (3/4) ... [2019-11-15 23:12:41,091 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:12:41,104 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-15 23:12:41,104 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 23:12:41,105 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:12:41,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() [2019-11-15 23:12:41,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-15 23:12:41,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-15 23:12:41,132 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-15 23:12:41,132 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-15 23:12:41,168 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7a029392-eeb5-45e2-8c9c-fcd92e713896/bin/uautomizer/witness.graphml [2019-11-15 23:12:41,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:12:41,169 INFO L168 Benchmark]: Toolchain (without parser) took 6419.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -204.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:41,169 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:41,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:41,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:41,171 INFO L168 Benchmark]: Boogie Preprocessor took 36.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:41,171 INFO L168 Benchmark]: RCFGBuilder took 525.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:41,171 INFO L168 Benchmark]: TraceAbstraction took 5369.52 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.0 MB). Peak memory consumption was 302.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:41,172 INFO L168 Benchmark]: Witness Printer took 81.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:41,174 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 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 525.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5369.52 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.0 MB). Peak memory consumption was 302.6 MB. Max. memory is 11.5 GB. * Witness Printer took 81.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant [2019-11-15 23:12:41,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-15 23:12:41,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] Derived loop invariant: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 18]: Loop Invariant [2019-11-15 23:12:41,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-15 23:12:41,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 45]: Loop Invariant [2019-11-15 23:12:41,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 57]: Loop Invariant [2019-11-15 23:12:41,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 18]: Loop Invariant [2019-11-15 23:12:41,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-15 23:12:41,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 222 HoareAnnotationTreeSize, 8 FomulaSimplifications, 54 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 21300 SizeOfPredicates, 38 NumberOfNonLiveVariables, 457 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...