./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4284cb37841cd94fe17da64cc250a8a1e69c6375 ............................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4284cb37841cd94fe17da64cc250a8a1e69c6375 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:52:08,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:08,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:08,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:08,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:08,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:08,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:08,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:08,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:08,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:08,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:08,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:08,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:08,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:08,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:08,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:08,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:08,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:08,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:08,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:08,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:08,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:08,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:08,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:08,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:08,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:08,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:08,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:08,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:08,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:08,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:08,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:08,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:08,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:08,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:08,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:08,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:08,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:08,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:08,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:08,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:08,975 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:52:08,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:09,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:09,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:09,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:09,012 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:09,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:09,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:09,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:52:09,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:09,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:09,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:09,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:09,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:09,014 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:09,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:09,014 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:09,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:09,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:09,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:09,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:09,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:09,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:09,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:09,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:09,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:09,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:52:09,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:52:09,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:09,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-25 08:52:09,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:09,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:09,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:09,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:09,197 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:09,198 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-25 08:52:09,261 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data/1014b87b1/9e9538fad8af4640a62add5c48a0a00d/FLAG238fff75d [2019-11-25 08:52:09,623 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:09,624 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-25 08:52:09,630 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data/1014b87b1/9e9538fad8af4640a62add5c48a0a00d/FLAG238fff75d [2019-11-25 08:52:10,060 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data/1014b87b1/9e9538fad8af4640a62add5c48a0a00d [2019-11-25 08:52:10,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:10,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:10,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:10,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:10,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:10,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2b1b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10, skipping insertion in model container [2019-11-25 08:52:10,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:10,097 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:10,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:10,330 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:10,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:10,380 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:10,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10 WrapperNode [2019-11-25 08:52:10,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:10,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:10,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:10,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:10,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:10,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:10,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:10,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:10,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... [2019-11-25 08:52:10,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:10,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:10,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:10,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:10,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:52:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-25 08:52:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:52:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:52:10,891 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:10,891 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-25 08:52:10,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:10 BoogieIcfgContainer [2019-11-25 08:52:10,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:10,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:52:10,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:52:10,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:52:10,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:52:10" (1/3) ... [2019-11-25 08:52:10,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ccd770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:10, skipping insertion in model container [2019-11-25 08:52:10,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:10" (2/3) ... [2019-11-25 08:52:10,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ccd770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:10, skipping insertion in model container [2019-11-25 08:52:10,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:10" (3/3) ... [2019-11-25 08:52:10,900 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-25 08:52:10,909 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:52:10,914 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:52:10,923 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:52:10,951 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:52:10,952 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:52:10,952 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:52:10,952 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:10,952 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:10,953 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:52:10,953 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:10,953 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:52:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-25 08:52:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:52:10,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:10,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:10,974 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-25 08:52:10,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:10,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863349706] [2019-11-25 08:52:10,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:11,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863349706] [2019-11-25 08:52:11,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:11,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:52:11,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609053825] [2019-11-25 08:52:11,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:52:11,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:11,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:52:11,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:52:11,095 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-25 08:52:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:11,113 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-25 08:52:11,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:52:11,114 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-25 08:52:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:11,124 INFO L225 Difference]: With dead ends: 62 [2019-11-25 08:52:11,124 INFO L226 Difference]: Without dead ends: 29 [2019-11-25 08:52:11,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:52:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-25 08:52:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-25 08:52:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-25 08:52:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-25 08:52:11,159 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-25 08:52:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:11,160 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-25 08:52:11,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:52:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-25 08:52:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:52:11,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:11,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:11,162 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:11,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:11,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-25 08:52:11,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:11,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950792326] [2019-11-25 08:52:11,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:11,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950792326] [2019-11-25 08:52:11,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:11,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:11,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493057506] [2019-11-25 08:52:11,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:11,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:11,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:11,253 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-25 08:52:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:11,335 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-25 08:52:11,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:11,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-25 08:52:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:11,339 INFO L225 Difference]: With dead ends: 53 [2019-11-25 08:52:11,339 INFO L226 Difference]: Without dead ends: 44 [2019-11-25 08:52:11,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-25 08:52:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-25 08:52:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-25 08:52:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-25 08:52:11,351 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-25 08:52:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:11,351 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-25 08:52:11,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-25 08:52:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:52:11,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:11,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:11,354 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:11,354 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-25 08:52:11,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:11,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151199320] [2019-11-25 08:52:11,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:11,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151199320] [2019-11-25 08:52:11,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:11,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:11,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007800919] [2019-11-25 08:52:11,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:11,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:11,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:11,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:11,456 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-25 08:52:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:11,515 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-25 08:52:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:11,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-25 08:52:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:11,518 INFO L225 Difference]: With dead ends: 55 [2019-11-25 08:52:11,518 INFO L226 Difference]: Without dead ends: 46 [2019-11-25 08:52:11,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-25 08:52:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-25 08:52:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-25 08:52:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-25 08:52:11,526 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-25 08:52:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:11,526 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-25 08:52:11,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-25 08:52:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:52:11,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:11,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:11,528 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:11,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-25 08:52:11,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:11,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316656984] [2019-11-25 08:52:11,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:11,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:11,618 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:52:11,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:11 BoogieIcfgContainer [2019-11-25 08:52:11,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:11,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:11,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:11,643 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:11,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:10" (3/4) ... [2019-11-25 08:52:11,646 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:52:11,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:11,648 INFO L168 Benchmark]: Toolchain (without parser) took 1583.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -105.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:11,649 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:11,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:11,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:11,651 INFO L168 Benchmark]: Boogie Preprocessor took 43.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:11,652 INFO L168 Benchmark]: RCFGBuilder took 426.90 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:11,652 INFO L168 Benchmark]: TraceAbstraction took 748.05 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:11,653 INFO L168 Benchmark]: Witness Printer took 4.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:11,656 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 426.90 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 748.05 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.09 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 75. Possible FailurePath: [L74] double x = 0.0; [L75] double y = -0.0; [L19] __uint32_t msw, lsw; [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.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-6b5699a [2019-11-25 08:52:13,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:13,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:13,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:13,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:13,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:13,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:13,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:13,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:13,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:13,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:13,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:13,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:13,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:13,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:13,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:13,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:13,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:13,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:13,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:13,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:13,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:13,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:13,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:13,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:13,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:13,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:13,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:13,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:13,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:13,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:13,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:13,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:13,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:13,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:13,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:13,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:13,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:13,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:13,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:13,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:13,679 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:52:13,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:13,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:13,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:13,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:13,695 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:13,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:13,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:13,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:13,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:13,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:13,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:13,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:13,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:52:13,697 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:52:13,697 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:52:13,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:13,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:13,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:13,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:13,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:13,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:13,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:13,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:13,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:13,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:13,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:13,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:13,701 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:52:13,701 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:52:13,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:13,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:52:13,702 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-25 08:52:13,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:13,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:13,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:14,001 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:14,001 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:14,002 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-25 08:52:14,052 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data/5ff89ed00/c298de9c0edc47579cd5f38da67e860a/FLAG77cb23520 [2019-11-25 08:52:14,423 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:14,423 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-25 08:52:14,429 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data/5ff89ed00/c298de9c0edc47579cd5f38da67e860a/FLAG77cb23520 [2019-11-25 08:52:14,867 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/data/5ff89ed00/c298de9c0edc47579cd5f38da67e860a [2019-11-25 08:52:14,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:14,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:14,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:14,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:14,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:14,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:14" (1/1) ... [2019-11-25 08:52:14,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7890b756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:14, skipping insertion in model container [2019-11-25 08:52:14,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:14" (1/1) ... [2019-11-25 08:52:14,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:14,906 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:15,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:15,104 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:15,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:15,213 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:15,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15 WrapperNode [2019-11-25 08:52:15,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:15,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:15,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:15,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:15,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... [2019-11-25 08:52:15,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... [2019-11-25 08:52:15,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:15,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:15,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:15,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:15,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... [2019-11-25 08:52:15,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... [2019-11-25 08:52:15,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... [2019-11-25 08:52:15,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... [2019-11-25 08:52:15,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... [2019-11-25 08:52:15,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... [2019-11-25 08:52:15,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... [2019-11-25 08:52:15,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:15,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:15,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:15,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:15,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-25 08:52:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:52:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 08:52:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:15,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:52:15,805 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:15,806 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-25 08:52:15,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:15 BoogieIcfgContainer [2019-11-25 08:52:15,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:15,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:52:15,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:52:15,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:52:15,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:52:14" (1/3) ... [2019-11-25 08:52:15,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dba3119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:15, skipping insertion in model container [2019-11-25 08:52:15,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:15" (2/3) ... [2019-11-25 08:52:15,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dba3119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:15, skipping insertion in model container [2019-11-25 08:52:15,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:15" (3/3) ... [2019-11-25 08:52:15,815 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-25 08:52:15,822 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:52:15,828 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:52:15,837 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:52:15,857 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:52:15,857 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:52:15,857 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:52:15,857 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:15,857 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:15,857 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:52:15,858 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:15,858 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:52:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-25 08:52:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:52:15,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:15,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:15,875 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:15,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:15,880 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-25 08:52:15,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:52:15,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402196888] [2019-11-25 08:52:15,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-25 08:52:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:15,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-25 08:52:15,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:15,994 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:52:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:15,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402196888] [2019-11-25 08:52:15,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:15,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 08:52:16,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703412194] [2019-11-25 08:52:16,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:52:16,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:52:16,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:52:16,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:52:16,020 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-25 08:52:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:16,038 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-25 08:52:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:52:16,040 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-25 08:52:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:16,054 INFO L225 Difference]: With dead ends: 62 [2019-11-25 08:52:16,054 INFO L226 Difference]: Without dead ends: 29 [2019-11-25 08:52:16,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:52:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-25 08:52:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-25 08:52:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-25 08:52:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-25 08:52:16,092 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-25 08:52:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:16,093 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-25 08:52:16,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:52:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-25 08:52:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:52:16,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:16,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:16,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 08:52:16,295 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-25 08:52:16,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:52:16,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452816643] [2019-11-25 08:52:16,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-25 08:52:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:16,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:52:16,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:16,420 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:52:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:16,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452816643] [2019-11-25 08:52:16,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:16,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 08:52:16,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488008285] [2019-11-25 08:52:16,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:52:16,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:52:16,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:52:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:16,445 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-25 08:52:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:16,608 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-25 08:52:16,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:16,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-25 08:52:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:16,610 INFO L225 Difference]: With dead ends: 68 [2019-11-25 08:52:16,612 INFO L226 Difference]: Without dead ends: 59 [2019-11-25 08:52:16,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-25 08:52:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-25 08:52:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-25 08:52:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-25 08:52:16,625 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-25 08:52:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:16,629 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-25 08:52:16,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:52:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-25 08:52:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:52:16,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:16,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:16,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 08:52:16,836 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-25 08:52:16,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:52:16,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291613312] [2019-11-25 08:52:16,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-25 08:52:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:16,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:52:16,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:16,977 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:52:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:17,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291613312] [2019-11-25 08:52:17,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:17,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 08:52:17,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143463508] [2019-11-25 08:52:17,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:52:17,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:52:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:52:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:17,038 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-25 08:52:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:17,150 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-25 08:52:17,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:17,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-25 08:52:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:17,152 INFO L225 Difference]: With dead ends: 52 [2019-11-25 08:52:17,152 INFO L226 Difference]: Without dead ends: 28 [2019-11-25 08:52:17,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-25 08:52:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-25 08:52:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-25 08:52:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-25 08:52:17,157 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-25 08:52:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:17,158 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-25 08:52:17,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:52:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-25 08:52:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:52:17,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:17,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:17,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 08:52:17,360 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:17,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-25 08:52:17,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:52:17,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081036082] [2019-11-25 08:52:17,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-25 08:52:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:17,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:52:17,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:17,491 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:52:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:17,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081036082] [2019-11-25 08:52:17,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:17,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 08:52:17,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161302342] [2019-11-25 08:52:17,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:52:17,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:52:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:52:17,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:17,511 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-25 08:52:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:17,599 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-25 08:52:17,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:17,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-25 08:52:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:17,601 INFO L225 Difference]: With dead ends: 65 [2019-11-25 08:52:17,602 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 08:52:17,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 08:52:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-25 08:52:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:52:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-25 08:52:17,615 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-25 08:52:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:17,616 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-25 08:52:17,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:52:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-25 08:52:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:52:17,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:17,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:17,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 08:52:17,834 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:17,834 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-25 08:52:17,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:52:17,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196535422] [2019-11-25 08:52:17,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-25 08:52:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:17,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:52:17,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:17,963 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:52:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:17,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196535422] [2019-11-25 08:52:17,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:17,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-25 08:52:17,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442719718] [2019-11-25 08:52:17,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:17,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:52:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:17,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:17,996 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-25 08:52:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:18,008 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-25 08:52:18,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:18,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-25 08:52:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:18,011 INFO L225 Difference]: With dead ends: 40 [2019-11-25 08:52:18,012 INFO L226 Difference]: Without dead ends: 30 [2019-11-25 08:52:18,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-25 08:52:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-25 08:52:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:52:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-25 08:52:18,022 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-25 08:52:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:18,022 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-25 08:52:18,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-25 08:52:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:52:18,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:18,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:18,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 08:52:18,224 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:18,224 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-25 08:52:18,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:52:18,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567909604] [2019-11-25 08:52:18,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-25 08:52:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:18,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:52:18,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:18,403 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:52:18,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:18,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567909604] [2019-11-25 08:52:18,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:18,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-25 08:52:18,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328708733] [2019-11-25 08:52:18,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:52:18,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:52:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:52:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:52:18,477 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-25 08:52:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:18,645 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-25 08:52:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:52:18,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-25 08:52:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:18,647 INFO L225 Difference]: With dead ends: 42 [2019-11-25 08:52:18,647 INFO L226 Difference]: Without dead ends: 39 [2019-11-25 08:52:18,647 INFO L630 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-11-25 08:52:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-25 08:52:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-25 08:52:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-25 08:52:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-25 08:52:18,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-25 08:52:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:18,653 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-25 08:52:18,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:52:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-25 08:52:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:52:18,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:18,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:18,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 08:52:18,861 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-25 08:52:18,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:52:18,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715297759] [2019-11-25 08:52:18,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-25 08:52:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:18,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:52:18,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:18,991 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:52:19,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:19,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715297759] [2019-11-25 08:52:19,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:19,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-25 08:52:19,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836224219] [2019-11-25 08:52:19,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:52:19,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:52:19,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:52:19,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:19,118 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-25 08:52:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:19,247 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-25 08:52:19,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:19,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-25 08:52:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:19,250 INFO L225 Difference]: With dead ends: 45 [2019-11-25 08:52:19,250 INFO L226 Difference]: Without dead ends: 27 [2019-11-25 08:52:19,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-25 08:52:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-25 08:52:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-25 08:52:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-25 08:52:19,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-25 08:52:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:19,255 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-25 08:52:19,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:52:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-25 08:52:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:52:19,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:19,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:19,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 08:52:19,457 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-25 08:52:19,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:52:19,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52312800] [2019-11-25 08:52:19,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-25 08:52:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:19,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 08:52:19,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:19,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:19,693 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:52:19,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:19,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52312800] [2019-11-25 08:52:19,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:19,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-25 08:52:19,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455570842] [2019-11-25 08:52:19,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-25 08:52:19,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:52:19,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 08:52:19,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:52:19,924 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-25 08:52:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:20,158 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-25 08:52:20,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:52:20,159 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-25 08:52:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:20,160 INFO L225 Difference]: With dead ends: 27 [2019-11-25 08:52:20,160 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:52:20,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:52:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:52:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:52:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:52:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:52:20,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-25 08:52:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:20,161 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:52:20,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-25 08:52:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:52:20,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:52:20,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 08:52:20,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:52:20,701 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:52:20,701 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:52:20,701 INFO L444 ceAbstractionStarter]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2019-11-25 08:52:20,701 INFO L440 ceAbstractionStarter]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-25 08:52:20,701 INFO L444 ceAbstractionStarter]: For program point L21-3(lines 18 43) no Hoare annotation was computed. [2019-11-25 08:52:20,701 INFO L444 ceAbstractionStarter]: For program point L21-5(lines 21 26) no Hoare annotation was computed. [2019-11-25 08:52:20,702 INFO L440 ceAbstractionStarter]: At program point L21-6(lines 21 26) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-25 08:52:20,702 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-25 08:52:20,702 INFO L444 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2019-11-25 08:52:20,702 INFO L444 ceAbstractionStarter]: For program point L21-7(lines 18 43) no Hoare annotation was computed. [2019-11-25 08:52:20,702 INFO L444 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-11-25 08:52:20,702 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-11-25 08:52:20,702 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2019-11-25 08:52:20,703 INFO L440 ceAbstractionStarter]: At program point L63(lines 54 64) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= (_ bv0 32) (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32))) (= ULTIMATE.start___fpclassify_double_~x .cse0) (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3)) (fp.neg (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-25 08:52:20,703 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-25 08:52:20,703 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 42) no Hoare annotation was computed. [2019-11-25 08:52:20,703 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 31 42) no Hoare annotation was computed. [2019-11-25 08:52:20,703 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 49) no Hoare annotation was computed. [2019-11-25 08:52:20,703 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:52:20,704 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2019-11-25 08:52:20,704 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-25 08:52:20,704 INFO L440 ceAbstractionStarter]: At program point L57-2(lines 57 61) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___fpclassify_double_~x .cse0) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-25 08:52:20,704 INFO L444 ceAbstractionStarter]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2019-11-25 08:52:20,704 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:52:20,733 INFO L440 ceAbstractionStarter]: At program point L42(lines 18 43) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-25 08:52:20,733 INFO L440 ceAbstractionStarter]: At program point L42-1(lines 18 43) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-25 08:52:20,733 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-25 08:52:20,733 INFO L444 ceAbstractionStarter]: For program point L34-1(lines 34 42) no Hoare annotation was computed. [2019-11-25 08:52:20,733 INFO L447 ceAbstractionStarter]: At program point L84(lines 66 85) the Hoare annotation is: true [2019-11-25 08:52:20,733 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-25 08:52:20,734 INFO L444 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-11-25 08:52:20,734 INFO L440 ceAbstractionStarter]: At program point L51-3(lines 45 52) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-25 08:52:20,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:20 BoogieIcfgContainer [2019-11-25 08:52:20,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:20,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:20,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:20,775 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:20,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:15" (3/4) ... [2019-11-25 08:52:20,781 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:52:20,799 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-25 08:52:20,799 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 08:52:20,800 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 08:52:20,833 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() [2019-11-25 08:52:20,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-25 08:52:20,835 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-25 08:52:20,836 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-25 08:52:20,837 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-25 08:52:20,886 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_177d0e71-6480-45e0-a0c1-14d466218b2f/bin/uautomizer/witness.graphml [2019-11-25 08:52:20,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:20,889 INFO L168 Benchmark]: Toolchain (without parser) took 6017.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -238.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:20,889 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:20,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,890 INFO L168 Benchmark]: Boogie Preprocessor took 31.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:20,890 INFO L168 Benchmark]: RCFGBuilder took 514.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,891 INFO L168 Benchmark]: TraceAbstraction took 4966.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.1 MB). Peak memory consumption was 292.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,891 INFO L168 Benchmark]: Witness Printer took 112.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,893 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.49 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 514.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4966.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.1 MB). Peak memory consumption was 292.1 MB. Max. memory is 11.5 GB. * Witness Printer took 112.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant [2019-11-25 08:52:20,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:52:20,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] Derived loop invariant: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 18]: Loop Invariant [2019-11-25 08:52:20,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:52:20,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 45]: Loop Invariant [2019-11-25 08:52:20,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 57]: Loop Invariant [2019-11-25 08:52:20,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 18]: Loop Invariant [2019-11-25 08:52:20,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:52:20,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 4.8s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, 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, 1.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, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 221 HoareAnnotationTreeSize, 8 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 28 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 21300 SizeOfPredicates, 38 NumberOfNonLiveVariables, 473 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...