./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.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/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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 b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ..................................................................................................................................................................................................................................................................................................................................................................... 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/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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 b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:12,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:12,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:12,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:12,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:12,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:12,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:12,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:12,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:12,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:12,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:12,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:12,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:12,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:12,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:12,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:12,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:12,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:12,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:12,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:12,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:12,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:12,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:12,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:12,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:12,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:12,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:12,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:12,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:12,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:12,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:12,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:12,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:12,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:12,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:12,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:12,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:12,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:12,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:12,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:12,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:12,044 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:55:12,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:12,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:12,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:12,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:12,056 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:12,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:12,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:12,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:12,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:12,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:12,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:55:12,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:55:12,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:55:12,058 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:12,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:12,058 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:12,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:55:12,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:12,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:12,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:55:12,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:55:12,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:12,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:12,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:55:12,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:55:12,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:12,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:55:12,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:55:12,060 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/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-10-22 08:55:12,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:12,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:12,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:12,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:12,103 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:12,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-10-22 08:55:12,155 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data/0884d1ae9/a6b10096dc414289a619950786f42f0f/FLAGcf734f64d [2019-10-22 08:55:12,553 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:12,554 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-10-22 08:55:12,558 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data/0884d1ae9/a6b10096dc414289a619950786f42f0f/FLAGcf734f64d [2019-10-22 08:55:12,568 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data/0884d1ae9/a6b10096dc414289a619950786f42f0f [2019-10-22 08:55:12,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:12,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:12,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:12,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:12,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:12,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411f8c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12, skipping insertion in model container [2019-10-22 08:55:12,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,586 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:12,602 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:12,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:12,779 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:12,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:12,897 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:12,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12 WrapperNode [2019-10-22 08:55:12,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:12,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:12,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:12,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:12,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:12,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:12,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:12,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:12,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... [2019-10-22 08:55:12,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:12,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:12,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:12,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:12,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-10-22 08:55:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:13,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:55:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:13,352 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:13,352 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-10-22 08:55:13,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:13 BoogieIcfgContainer [2019-10-22 08:55:13,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:13,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:55:13,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:55:13,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:55:13,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:55:12" (1/3) ... [2019-10-22 08:55:13,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9fd290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:13, skipping insertion in model container [2019-10-22 08:55:13,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:12" (2/3) ... [2019-10-22 08:55:13,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9fd290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:13, skipping insertion in model container [2019-10-22 08:55:13,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:13" (3/3) ... [2019-10-22 08:55:13,361 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-10-22 08:55:13,370 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:55:13,382 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:55:13,393 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:55:13,415 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:55:13,415 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:55:13,415 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:55:13,415 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:13,418 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:13,419 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:55:13,419 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:13,419 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:55:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-22 08:55:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:55:13,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:13,445 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:13,447 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-10-22 08:55:13,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289720465] [2019-10-22 08:55:13,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:13,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289720465] [2019-10-22 08:55:13,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:13,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:13,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062373333] [2019-10-22 08:55:13,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 08:55:13,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:13,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:55:13,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:55:13,606 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-22 08:55:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:13,625 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-10-22 08:55:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:13,626 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-22 08:55:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:13,635 INFO L225 Difference]: With dead ends: 62 [2019-10-22 08:55:13,635 INFO L226 Difference]: Without dead ends: 29 [2019-10-22 08:55:13,637 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-10-22 08:55:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-22 08:55:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 08:55:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:55:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-10-22 08:55:13,671 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-10-22 08:55:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:13,671 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-10-22 08:55:13,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 08:55:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-10-22 08:55:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:55:13,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:13,672 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:13,672 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:13,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-10-22 08:55:13,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76540759] [2019-10-22 08:55:13,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:13,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76540759] [2019-10-22 08:55:13,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:13,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:13,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546012655] [2019-10-22 08:55:13,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:13,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:13,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:13,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:13,747 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-10-22 08:55:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:13,801 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-10-22 08:55:13,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:13,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 08:55:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:13,802 INFO L225 Difference]: With dead ends: 53 [2019-10-22 08:55:13,802 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 08:55:13,803 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-10-22 08:55:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 08:55:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-10-22 08:55:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:55:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-10-22 08:55:13,813 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-10-22 08:55:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:13,813 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-22 08:55:13,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-10-22 08:55:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:55:13,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:13,816 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:13,816 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-10-22 08:55:13,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149640732] [2019-10-22 08:55:13,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:13,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149640732] [2019-10-22 08:55:13,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:13,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:13,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317828801] [2019-10-22 08:55:13,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:13,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:13,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:13,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:13,902 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-10-22 08:55:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:13,951 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-10-22 08:55:13,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:13,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-22 08:55:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:13,955 INFO L225 Difference]: With dead ends: 55 [2019-10-22 08:55:13,956 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 08:55:13,956 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-10-22 08:55:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 08:55:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-10-22 08:55:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:55:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-10-22 08:55:13,961 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-10-22 08:55:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:13,962 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-22 08:55:13,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-10-22 08:55:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:55:13,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:13,963 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:13,963 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-10-22 08:55:13,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3060689] [2019-10-22 08:55:13,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,034 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:14,034 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:55:14,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:55:14 BoogieIcfgContainer [2019-10-22 08:55:14,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:55:14,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:14,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:14,060 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:14,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:13" (3/4) ... [2019-10-22 08:55:14,064 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:14,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:14,066 INFO L168 Benchmark]: Toolchain (without parser) took 1494.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -70.7 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:14,066 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:14,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:14,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.64 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-10-22 08:55:14,068 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:14,068 INFO L168 Benchmark]: RCFGBuilder took 391.15 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:14,069 INFO L168 Benchmark]: TraceAbstraction took 704.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:14,069 INFO L168 Benchmark]: Witness Printer took 4.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:14,071 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.64 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 25.50 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 391.15 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 704.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.50 ms. Allocated memory is still 1.1 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: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 79. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; [L24] __uint32_t msw, lsw; [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, 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.0s 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-10-22 08:55:16,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:16,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:16,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:16,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:16,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:16,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:16,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:16,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:16,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:16,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:16,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:16,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:16,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:16,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:16,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:16,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:16,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:16,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:16,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:16,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:16,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:16,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:16,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:16,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:16,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:16,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:16,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:16,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:16,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:16,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:16,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:16,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:16,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:16,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:16,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:16,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:16,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:16,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:16,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:16,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:16,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 08:55:16,213 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:16,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:16,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:16,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:16,214 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:16,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:16,215 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:16,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:16,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:16,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:55:16,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:55:16,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:55:16,216 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 08:55:16,216 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 08:55:16,216 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:16,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:16,217 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:16,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:55:16,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:16,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:16,217 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:55:16,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:55:16,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:16,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:16,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:55:16,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:55:16,218 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 08:55:16,219 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 08:55:16,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:55:16,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 08:55:16,219 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/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-10-22 08:55:16,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:16,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:16,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:16,261 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:16,262 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:16,262 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-10-22 08:55:16,307 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data/a5dcef1a9/6620345f0ff9484daee5105e43014467/FLAG969116ad5 [2019-10-22 08:55:16,723 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:16,724 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-10-22 08:55:16,730 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data/a5dcef1a9/6620345f0ff9484daee5105e43014467/FLAG969116ad5 [2019-10-22 08:55:16,742 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/data/a5dcef1a9/6620345f0ff9484daee5105e43014467 [2019-10-22 08:55:16,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:16,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:16,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:16,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:16,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:16,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:16,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263ed1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16, skipping insertion in model container [2019-10-22 08:55:16,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:16,770 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:16,787 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:16,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:16,941 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:16,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:16,994 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:16,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16 WrapperNode [2019-10-22 08:55:16,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:16,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:16,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:16,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:17,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:17,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:17,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:17,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:17,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:17,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:17,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:17,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:17,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:17,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:17,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:17,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:17,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... [2019-10-22 08:55:17,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:17,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:17,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:17,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:17,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-10-22 08:55:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 08:55:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:17,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:17,607 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:17,608 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-10-22 08:55:17,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:17 BoogieIcfgContainer [2019-10-22 08:55:17,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:17,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:55:17,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:55:17,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:55:17,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:55:16" (1/3) ... [2019-10-22 08:55:17,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb36cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:17, skipping insertion in model container [2019-10-22 08:55:17,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:16" (2/3) ... [2019-10-22 08:55:17,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb36cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:17, skipping insertion in model container [2019-10-22 08:55:17,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:17" (3/3) ... [2019-10-22 08:55:17,617 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-10-22 08:55:17,626 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:55:17,632 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:55:17,639 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:55:17,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:55:17,664 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:55:17,664 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:55:17,664 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:17,664 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:17,665 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:55:17,665 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:17,665 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:55:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-22 08:55:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:55:17,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:17,687 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:17,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-10-22 08:55:17,701 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:17,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745353210] [2019-10-22 08:55:17,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:17,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 08:55:17,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:17,793 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:17,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745353210] [2019-10-22 08:55:17,797 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:17,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 08:55:17,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305145715] [2019-10-22 08:55:17,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 08:55:17,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:17,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:55:17,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:55:17,814 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-22 08:55:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:17,832 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-10-22 08:55:17,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:17,833 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-22 08:55:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:17,841 INFO L225 Difference]: With dead ends: 62 [2019-10-22 08:55:17,841 INFO L226 Difference]: Without dead ends: 29 [2019-10-22 08:55:17,844 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-10-22 08:55:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-22 08:55:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 08:55:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:55:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-10-22 08:55:17,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-10-22 08:55:17,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:17,874 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-10-22 08:55:17,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 08:55:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-10-22 08:55:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:55:17,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:17,875 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:18,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-10-22 08:55:18,076 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:18,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:18,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-10-22 08:55:18,077 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:18,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527726440] [2019-10-22 08:55:18,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:18,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:18,195 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:18,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527726440] [2019-10-22 08:55:18,228 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:18,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:55:18,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904969913] [2019-10-22 08:55:18,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:18,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:18,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:18,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:18,234 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-10-22 08:55:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:18,481 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-10-22 08:55:18,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:18,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-10-22 08:55:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:18,488 INFO L225 Difference]: With dead ends: 68 [2019-10-22 08:55:18,489 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 08:55:18,490 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-10-22 08:55:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 08:55:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-10-22 08:55:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:55:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-10-22 08:55:18,495 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-10-22 08:55:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:18,496 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-22 08:55:18,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-10-22 08:55:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:55:18,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:18,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:18,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-10-22 08:55:18,699 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-10-22 08:55:18,700 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:18,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429631917] [2019-10-22 08:55:18,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:18,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:55:18,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:18,827 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:18,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:18,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429631917] [2019-10-22 08:55:18,891 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:18,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:55:18,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019867651] [2019-10-22 08:55:18,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:18,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:18,895 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-10-22 08:55:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:18,989 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-10-22 08:55:18,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:18,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-22 08:55:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:18,991 INFO L225 Difference]: With dead ends: 52 [2019-10-22 08:55:18,991 INFO L226 Difference]: Without dead ends: 28 [2019-10-22 08:55:18,991 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-10-22 08:55:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-22 08:55:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-22 08:55:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 08:55:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-10-22 08:55:18,995 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-10-22 08:55:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:18,996 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 08:55:18,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-10-22 08:55:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:55:18,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:18,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:19,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-10-22 08:55:19,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-10-22 08:55:19,198 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:19,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104899710] [2019-10-22 08:55:19,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:19,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:19,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:19,311 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:19,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104899710] [2019-10-22 08:55:19,331 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:19,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:55:19,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330142513] [2019-10-22 08:55:19,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:19,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:19,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:19,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:19,333 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-10-22 08:55:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:19,421 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-10-22 08:55:19,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:19,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 08:55:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:19,422 INFO L225 Difference]: With dead ends: 65 [2019-10-22 08:55:19,422 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 08:55:19,423 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-10-22 08:55:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 08:55:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-10-22 08:55:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 08:55:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-10-22 08:55:19,427 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-10-22 08:55:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:19,428 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-10-22 08:55:19,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-10-22 08:55:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:55:19,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:19,429 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:19,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-10-22 08:55:19,636 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:19,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:19,636 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-10-22 08:55:19,636 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:19,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472699973] [2019-10-22 08:55:19,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:19,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:19,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:19,768 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:19,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472699973] [2019-10-22 08:55:19,799 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:19,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 08:55:19,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141813597] [2019-10-22 08:55:19,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:19,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:19,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:19,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:19,801 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-10-22 08:55:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:19,818 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-10-22 08:55:19,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:19,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 08:55:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:19,820 INFO L225 Difference]: With dead ends: 40 [2019-10-22 08:55:19,820 INFO L226 Difference]: Without dead ends: 30 [2019-10-22 08:55:19,820 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-10-22 08:55:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-22 08:55:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 08:55:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 08:55:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-10-22 08:55:19,827 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-10-22 08:55:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:19,828 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-10-22 08:55:19,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-10-22 08:55:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:55:19,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:19,832 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:20,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-10-22 08:55:20,033 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-10-22 08:55:20,034 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:20,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810344286] [2019-10-22 08:55:20,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:20,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:55:20,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:20,165 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:20,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810344286] [2019-10-22 08:55:20,213 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:20,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-10-22 08:55:20,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308633153] [2019-10-22 08:55:20,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:55:20,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:20,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:55:20,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:55:20,215 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-10-22 08:55:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:20,313 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-10-22 08:55:20,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:20,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-10-22 08:55:20,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:20,314 INFO L225 Difference]: With dead ends: 42 [2019-10-22 08:55:20,314 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 08:55:20,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:55:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 08:55:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-10-22 08:55:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:55:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-22 08:55:20,319 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-10-22 08:55:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:20,320 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-22 08:55:20,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:55:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-22 08:55:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:55:20,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:20,321 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-10-22 08:55:20,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-10-22 08:55:20,521 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:20,522 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-10-22 08:55:20,522 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:20,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562052568] [2019-10-22 08:55:20,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:20,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:55:20,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:20,639 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:20,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562052568] [2019-10-22 08:55:20,701 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:20,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-22 08:55:20,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056213552] [2019-10-22 08:55:20,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:55:20,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:20,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:55:20,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:20,703 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-10-22 08:55:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:20,790 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-10-22 08:55:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:20,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-10-22 08:55:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:20,793 INFO L225 Difference]: With dead ends: 45 [2019-10-22 08:55:20,793 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 08:55:20,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:55:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 08:55:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 08:55:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:55:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-22 08:55:20,802 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-10-22 08:55:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:20,802 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-22 08:55:20,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:55:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-22 08:55:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:55:20,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:20,803 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:21,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-10-22 08:55:21,004 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-10-22 08:55:21,005 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:21,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426332419] [2019-10-22 08:55:21,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/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-10-22 08:55:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:21,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 08:55:21,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:21,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:21,200 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:21,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:21,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426332419] [2019-10-22 08:55:21,403 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:21,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-10-22 08:55:21,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282755855] [2019-10-22 08:55:21,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 08:55:21,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:55:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:55:21,404 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-10-22 08:55:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:21,629 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-10-22 08:55:21,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:21,630 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-10-22 08:55:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:21,630 INFO L225 Difference]: With dead ends: 27 [2019-10-22 08:55:21,630 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:55:21,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-10-22 08:55:21,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:55:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:55:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:55:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:55:21,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-22 08:55:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:21,632 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:21,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 08:55:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:21,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:55:21,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-10-22 08:55:21,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:55:22,117 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-22 08:55:22,117 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-10-22 08:55:22,117 INFO L439 ceAbstractionStarter]: At program point L69(lines 60 70) the Hoare annotation is: (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|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (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)) (= (_ +zero 11 53) (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))))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-10-22 08:55:22,118 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-10-22 08:55:22,118 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 36 47) no Hoare annotation was computed. [2019-10-22 08:55:22,118 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:55:22,118 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:55:22,118 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 55) no Hoare annotation was computed. [2019-10-22 08:55:22,118 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2019-10-22 08:55:22,118 INFO L439 ceAbstractionStarter]: At program point L63-2(lines 63 67) the Hoare annotation is: (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|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-10-22 08:55:22,118 INFO L443 ceAbstractionStarter]: For program point L63-3(lines 63 67) no Hoare annotation was computed. [2019-10-22 08:55:22,119 INFO L439 ceAbstractionStarter]: At program point L47(lines 23 48) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0) (= (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)) (fp.neg (_ +zero 11 53))))) (= ULTIMATE.start_fmax_double_~x .cse0) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-10-22 08:55:22,119 INFO L439 ceAbstractionStarter]: At program point L47-1(lines 23 48) the Hoare annotation is: (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|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-10-22 08:55:22,119 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 47) no Hoare annotation was computed. [2019-10-22 08:55:22,119 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 39 47) no Hoare annotation was computed. [2019-10-22 08:55:22,119 INFO L446 ceAbstractionStarter]: At program point L89(lines 72 90) the Hoare annotation is: true [2019-10-22 08:55:22,119 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:55:22,119 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-10-22 08:55:22,120 INFO L443 ceAbstractionStarter]: For program point L57-2(line 57) no Hoare annotation was computed. [2019-10-22 08:55:22,120 INFO L439 ceAbstractionStarter]: At program point L57-3(lines 50 58) the Hoare annotation is: (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|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-10-22 08:55:22,121 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2019-10-22 08:55:22,121 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:55:22,121 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 26 31) no Hoare annotation was computed. [2019-10-22 08:55:22,121 INFO L439 ceAbstractionStarter]: At program point L26-2(lines 26 31) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmax_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-10-22 08:55:22,121 INFO L443 ceAbstractionStarter]: For program point L26-3(lines 23 48) no Hoare annotation was computed. [2019-10-22 08:55:22,121 INFO L443 ceAbstractionStarter]: For program point L26-5(lines 26 31) no Hoare annotation was computed. [2019-10-22 08:55:22,122 INFO L439 ceAbstractionStarter]: At program point L26-6(lines 26 31) the Hoare annotation is: (and (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-10-22 08:55:22,122 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-22 08:55:22,122 INFO L443 ceAbstractionStarter]: For program point L26-7(lines 23 48) no Hoare annotation was computed. [2019-10-22 08:55:22,122 INFO L443 ceAbstractionStarter]: For program point L84-2(lines 84 87) no Hoare annotation was computed. [2019-10-22 08:55:22,122 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-10-22 08:55:22,122 INFO L443 ceAbstractionStarter]: For program point L43-1(lines 43 47) no Hoare annotation was computed. [2019-10-22 08:55:22,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:55:22 BoogieIcfgContainer [2019-10-22 08:55:22,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:55:22,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:22,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:22,174 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:22,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:17" (3/4) ... [2019-10-22 08:55:22,179 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:55:22,197 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-10-22 08:55:22,198 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-10-22 08:55:22,198 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 08:55:22,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-10-22 08:55:22,235 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]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-10-22 08:55:22,236 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]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() [2019-10-22 08:55:22,236 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]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~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]))) && x == ~Pluszero~LONGDOUBLE() [2019-10-22 08:55:22,237 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]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-10-22 08:55:22,293 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2b7ee0f6-b830-4879-a4e9-75367322100e/bin/uautomizer/witness.graphml [2019-10-22 08:55:22,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:22,296 INFO L168 Benchmark]: Toolchain (without parser) took 5546.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -246.0 MB). Peak memory consumption was 291.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:22,299 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:22,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 934.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:22,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:22,300 INFO L168 Benchmark]: Boogie Preprocessor took 33.60 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-10-22 08:55:22,301 INFO L168 Benchmark]: RCFGBuilder took 475.55 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.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:22,301 INFO L168 Benchmark]: TraceAbstraction took 4562.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 810.8 MB in the end (delta: 290.1 MB). Peak memory consumption was 290.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:22,301 INFO L168 Benchmark]: Witness Printer took 121.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 810.8 MB in the beginning and 1.2 GB in the end (delta: -386.1 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:22,303 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 934.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.60 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 475.55 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.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4562.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 810.8 MB in the end (delta: 290.1 MB). Peak memory consumption was 290.1 MB. Max. memory is 11.5 GB. * Witness Printer took 121.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 810.8 MB in the beginning and 1.2 GB in the end (delta: -386.1 MB). Peak memory consumption was 10.8 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_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_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_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: 85]: 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: 23]: Loop Invariant [2019-10-22 08:55:22,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:55:22,316 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 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 60]: Loop Invariant [2019-10-22 08:55:22,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:55:22,319 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]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~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]))) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 50]: Loop Invariant [2019-10-22 08:55:22,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,322 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]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 63]: Loop Invariant [2019-10-22 08:55:22,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,324 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]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 23]: Loop Invariant [2019-10-22 08:55:22,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:55:22,326 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]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s 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, 206 HoareAnnotationTreeSize, 8 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 18200 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...