./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ............................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:46:06,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:46:06,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:46:06,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:46:06,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:46:06,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:46:06,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:46:06,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:46:06,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:46:06,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:46:06,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:46:06,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:46:06,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:46:06,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:46:06,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:46:06,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:46:06,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:46:06,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:46:06,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:46:06,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:46:06,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:46:06,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:46:06,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:46:06,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:46:06,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:46:06,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:46:06,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:46:06,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:46:06,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:46:06,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:46:06,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:46:06,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:46:06,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:46:06,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:46:06,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:46:06,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:46:06,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:46:06,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:46:06,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:46:06,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:46:06,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:46:06,482 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:46:06,506 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:46:06,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:46:06,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:46:06,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:46:06,507 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:46:06,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:46:06,508 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:46:06,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:46:06,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:46:06,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:46:06,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:46:06,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:46:06,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:46:06,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:46:06,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:46:06,509 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:46:06,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:46:06,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:46:06,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:46:06,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:46:06,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:46:06,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:46:06,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:46:06,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:46:06,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:46:06,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:46:06,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:46:06,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:46:06,512 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_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-25 08:46:06,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:46:06,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:46:06,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:46:06,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:46:06,707 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:46:06,708 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-25 08:46:06,767 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data/01bf4b3cd/74f3538ed60b4a5f93e8acae63666cbf/FLAG473bd0bd1 [2019-11-25 08:46:07,148 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:46:07,149 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-25 08:46:07,155 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data/01bf4b3cd/74f3538ed60b4a5f93e8acae63666cbf/FLAG473bd0bd1 [2019-11-25 08:46:07,576 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data/01bf4b3cd/74f3538ed60b4a5f93e8acae63666cbf [2019-11-25 08:46:07,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:46:07,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:46:07,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:07,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:46:07,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:46:07,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:07" (1/1) ... [2019-11-25 08:46:07,587 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:46:07, skipping insertion in model container [2019-11-25 08:46:07,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:07" (1/1) ... [2019-11-25 08:46:07,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:46:07,613 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:46:07,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:07,832 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:46:07,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:07,878 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:46:07,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07 WrapperNode [2019-11-25 08:46:07,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:07,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:07,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:46:07,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:46:07,886 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:46:07" (1/1) ... [2019-11-25 08:46:07,893 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:46:07" (1/1) ... [2019-11-25 08:46:07,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:07,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:46:07,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:46:07,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:46:07,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07" (1/1) ... [2019-11-25 08:46:07,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07" (1/1) ... [2019-11-25 08:46:07,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07" (1/1) ... [2019-11-25 08:46:07,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07" (1/1) ... [2019-11-25 08:46:07,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07" (1/1) ... [2019-11-25 08:46:07,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07" (1/1) ... [2019-11-25 08:46:07,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07" (1/1) ... [2019-11-25 08:46:07,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:46:07,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:46:07,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:46:07,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:46:07,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:46:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-25 08:46:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:46:08,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:46:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:46:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:46:08,442 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:46:08,442 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-25 08:46:08,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:08 BoogieIcfgContainer [2019-11-25 08:46:08,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:46:08,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:46:08,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:46:08,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:46:08,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:46:07" (1/3) ... [2019-11-25 08:46:08,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa6675c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:08, skipping insertion in model container [2019-11-25 08:46:08,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:07" (2/3) ... [2019-11-25 08:46:08,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa6675c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:08, skipping insertion in model container [2019-11-25 08:46:08,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:08" (3/3) ... [2019-11-25 08:46:08,451 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-25 08:46:08,460 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:46:08,469 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:46:08,479 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:46:08,503 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:46:08,503 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:46:08,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:46:08,503 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:46:08,504 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:46:08,504 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:46:08,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:46:08,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:46:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-25 08:46:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:46:08,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:08,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:08,525 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:08,530 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-25 08:46:08,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:08,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923816387] [2019-11-25 08:46:08,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:08,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923816387] [2019-11-25 08:46:08,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:08,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:08,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728287428] [2019-11-25 08:46:08,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:46:08,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:08,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:46:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:46:08,645 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-25 08:46:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:08,661 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-25 08:46:08,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:46:08,662 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-25 08:46:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:08,670 INFO L225 Difference]: With dead ends: 62 [2019-11-25 08:46:08,670 INFO L226 Difference]: Without dead ends: 29 [2019-11-25 08:46:08,673 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:46:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-25 08:46:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-25 08:46:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-25 08:46:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-25 08:46:08,705 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-25 08:46:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:08,706 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-25 08:46:08,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:46:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-25 08:46:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:46:08,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:08,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:08,707 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-25 08:46:08,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:08,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028470456] [2019-11-25 08:46:08,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:08,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028470456] [2019-11-25 08:46:08,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:08,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:46:08,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347149805] [2019-11-25 08:46:08,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:08,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:08,790 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-25 08:46:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:08,845 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-25 08:46:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:46:08,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-25 08:46:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:08,847 INFO L225 Difference]: With dead ends: 53 [2019-11-25 08:46:08,847 INFO L226 Difference]: Without dead ends: 44 [2019-11-25 08:46:08,848 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:46:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-25 08:46:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-25 08:46:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-25 08:46:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-25 08:46:08,855 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-25 08:46:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:08,855 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-25 08:46:08,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-25 08:46:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:46:08,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:08,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:08,857 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:08,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-25 08:46:08,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:08,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994344313] [2019-11-25 08:46:08,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:08,916 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:46:08,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994344313] [2019-11-25 08:46:08,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:08,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:46:08,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422310188] [2019-11-25 08:46:08,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:08,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:08,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:08,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:08,918 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-25 08:46:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:08,980 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-25 08:46:08,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:46:08,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-25 08:46:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:08,981 INFO L225 Difference]: With dead ends: 55 [2019-11-25 08:46:08,982 INFO L226 Difference]: Without dead ends: 46 [2019-11-25 08:46:08,982 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:46:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-25 08:46:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-25 08:46:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-25 08:46:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-25 08:46:08,988 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-25 08:46:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:08,989 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-25 08:46:08,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-25 08:46:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:46:08,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:08,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:08,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:08,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:08,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-25 08:46:08,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:08,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074569900] [2019-11-25 08:46:08,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:09,077 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:09,077 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:46:09,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:46:09 BoogieIcfgContainer [2019-11-25 08:46:09,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:46:09,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:46:09,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:46:09,115 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:46:09,116 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:08" (3/4) ... [2019-11-25 08:46:09,120 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:46:09,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:46:09,122 INFO L168 Benchmark]: Toolchain (without parser) took 1541.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 948.8 MB in the beginning and 1.0 GB in the end (delta: -96.1 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:09,122 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:46:09,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 948.8 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:09,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.43 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:46:09,124 INFO L168 Benchmark]: Boogie Preprocessor took 29.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:09,125 INFO L168 Benchmark]: RCFGBuilder took 494.96 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:09,125 INFO L168 Benchmark]: TraceAbstraction took 670.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:09,126 INFO L168 Benchmark]: Witness Printer took 5.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:46:09,129 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 948.8 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.43 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 29.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 494.96 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 670.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 79. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; [L24] __uint32_t msw, lsw; [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:46:10,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:46:10,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:46:10,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:46:10,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:46:10,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:46:10,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:46:10,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:46:10,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:46:10,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:46:10,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:46:10,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:46:10,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:46:10,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:46:10,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:46:10,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:46:10,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:46:10,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:46:10,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:46:10,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:46:11,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:46:11,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:46:11,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:46:11,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:46:11,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:46:11,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:46:11,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:46:11,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:46:11,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:46:11,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:46:11,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:46:11,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:46:11,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:46:11,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:46:11,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:46:11,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:46:11,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:46:11,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:46:11,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:46:11,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:46:11,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:46:11,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:46:11,031 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:46:11,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:46:11,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:46:11,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:46:11,033 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:46:11,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:46:11,033 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:46:11,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:46:11,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:46:11,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:46:11,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:46:11,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:46:11,035 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:46:11,035 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:46:11,035 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:46:11,035 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:46:11,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:46:11,036 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:46:11,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:46:11,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:46:11,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:46:11,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:46:11,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:46:11,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:46:11,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:46:11,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:46:11,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:46:11,038 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:46:11,039 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:46:11,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:46:11,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:46:11,039 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_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-25 08:46:11,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:46:11,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:46:11,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:46:11,339 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:46:11,340 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:46:11,340 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-25 08:46:11,391 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data/5272af12a/521454425c17460db65d08bb464b673e/FLAG6ed772193 [2019-11-25 08:46:11,784 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:46:11,786 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-25 08:46:11,792 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data/5272af12a/521454425c17460db65d08bb464b673e/FLAG6ed772193 [2019-11-25 08:46:12,125 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/data/5272af12a/521454425c17460db65d08bb464b673e [2019-11-25 08:46:12,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:46:12,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:46:12,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:12,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:46:12,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:46:12,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed0a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12, skipping insertion in model container [2019-11-25 08:46:12,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:46:12,159 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:46:12,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:12,367 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:46:12,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:12,423 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:46:12,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12 WrapperNode [2019-11-25 08:46:12,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:12,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:12,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:46:12,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:46:12,432 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:46:12" (1/1) ... [2019-11-25 08:46:12,494 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:46:12" (1/1) ... [2019-11-25 08:46:12,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:12,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:46:12,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:46:12,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:46:12,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:46:12,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:46:12,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:46:12,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:46:12,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-25 08:46:12,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:46:12,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 08:46:12,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:46:12,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:46:12,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:46:13,069 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:46:13,070 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-25 08:46:13,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:13 BoogieIcfgContainer [2019-11-25 08:46:13,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:46:13,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:46:13,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:46:13,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:46:13,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:46:12" (1/3) ... [2019-11-25 08:46:13,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cfefed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:13, skipping insertion in model container [2019-11-25 08:46:13,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (2/3) ... [2019-11-25 08:46:13,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cfefed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:13, skipping insertion in model container [2019-11-25 08:46:13,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:13" (3/3) ... [2019-11-25 08:46:13,077 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-25 08:46:13,085 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:46:13,091 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:46:13,100 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:46:13,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:46:13,118 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:46:13,118 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:46:13,118 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:46:13,119 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:46:13,119 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:46:13,119 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:46:13,119 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:46:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-25 08:46:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:46:13,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:13,139 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-25 08:46:13,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:46:13,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091966242] [2019-11-25 08:46:13,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:13,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-25 08:46:13,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:13,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:46:13,250 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:46:13,253 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:46:13,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091966242] [2019-11-25 08:46:13,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:13,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 08:46:13,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250071121] [2019-11-25 08:46:13,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:46:13,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:46:13,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:46:13,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:46:13,272 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-25 08:46:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:13,287 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-25 08:46:13,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:46:13,288 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-25 08:46:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:13,298 INFO L225 Difference]: With dead ends: 62 [2019-11-25 08:46:13,299 INFO L226 Difference]: Without dead ends: 29 [2019-11-25 08:46:13,302 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:46:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-25 08:46:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-25 08:46:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-25 08:46:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-25 08:46:13,330 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-25 08:46:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:13,331 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-25 08:46:13,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:46:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-25 08:46:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:46:13,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:13,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 08:46:13,542 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-25 08:46:13,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:46:13,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151730077] [2019-11-25 08:46:13,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:13,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:13,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:13,665 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:46:13,666 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:46:13,695 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:46:13,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151730077] [2019-11-25 08:46:13,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:13,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 08:46:13,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365551584] [2019-11-25 08:46:13,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:46:13,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:46:13,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:46:13,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:46:13,699 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-25 08:46:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:13,801 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-25 08:46:13,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:46:13,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-25 08:46:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:13,806 INFO L225 Difference]: With dead ends: 68 [2019-11-25 08:46:13,807 INFO L226 Difference]: Without dead ends: 59 [2019-11-25 08:46:13,809 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:46:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-25 08:46:13,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-25 08:46:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-25 08:46:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-25 08:46:13,820 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-25 08:46:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:13,822 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-25 08:46:13,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:46:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-25 08:46:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:46:13,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:14,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 08:46:14,030 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:14,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-25 08:46:14,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:46:14,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84279994] [2019-11-25 08:46:14,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:46:14,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:14,163 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:46:14,163 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:46:14,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:46:14,241 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:46:14,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84279994] [2019-11-25 08:46:14,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 08:46:14,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047456793] [2019-11-25 08:46:14,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:46:14,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:46:14,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:46:14,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:46:14,244 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-25 08:46:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,381 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-25 08:46:14,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:46:14,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-25 08:46:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,383 INFO L225 Difference]: With dead ends: 52 [2019-11-25 08:46:14,384 INFO L226 Difference]: Without dead ends: 28 [2019-11-25 08:46:14,384 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:46:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-25 08:46:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-25 08:46:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-25 08:46:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-25 08:46:14,390 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-25 08:46:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,390 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-25 08:46:14,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:46:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-25 08:46:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:46:14,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,391 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:46:14,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 08:46:14,592 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:14,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-25 08:46:14,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:46:14,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19075645] [2019-11-25 08:46:14,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:14,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:14,749 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:46:14,750 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:46:14,767 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:46:14,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19075645] [2019-11-25 08:46:14,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 08:46:14,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88625599] [2019-11-25 08:46:14,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:46:14,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:46:14,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:46:14,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:46:14,769 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-25 08:46:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,844 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-25 08:46:14,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:46:14,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-25 08:46:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,846 INFO L225 Difference]: With dead ends: 65 [2019-11-25 08:46:14,846 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 08:46:14,847 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:46:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 08:46:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-25 08:46:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:46:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-25 08:46:14,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-25 08:46:14,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,854 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-25 08:46:14,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:46:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-25 08:46:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:46:14,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,855 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:46:15,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 08:46:15,077 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:15,078 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-25 08:46:15,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:46:15,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10047118] [2019-11-25 08:46:15,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:46:15,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:15,189 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:46:15,189 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:46:15,233 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:46:15,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10047118] [2019-11-25 08:46:15,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:15,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-25 08:46:15,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196887364] [2019-11-25 08:46:15,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:15,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:46:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:15,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:15,236 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-25 08:46:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:15,257 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-25 08:46:15,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:15,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-25 08:46:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:15,259 INFO L225 Difference]: With dead ends: 40 [2019-11-25 08:46:15,259 INFO L226 Difference]: Without dead ends: 30 [2019-11-25 08:46:15,260 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:46:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-25 08:46:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-25 08:46:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:46:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-25 08:46:15,273 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-25 08:46:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:15,274 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-25 08:46:15,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-25 08:46:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:46:15,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:15,275 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:46:15,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 08:46:15,488 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:15,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-25 08:46:15,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:46:15,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65721679] [2019-11-25 08:46:15,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:46:15,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:15,643 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:46:15,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:46:15,701 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:46:15,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65721679] [2019-11-25 08:46:15,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:15,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-25 08:46:15,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831548972] [2019-11-25 08:46:15,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:46:15,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:46:15,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:46:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:46:15,703 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-25 08:46:15,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:15,829 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-25 08:46:15,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:46:15,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-25 08:46:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:15,831 INFO L225 Difference]: With dead ends: 42 [2019-11-25 08:46:15,831 INFO L226 Difference]: Without dead ends: 39 [2019-11-25 08:46:15,831 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:46:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-25 08:46:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-25 08:46:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-25 08:46:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-25 08:46:15,836 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-25 08:46:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:15,836 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-25 08:46:15,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:46:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-25 08:46:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:46:15,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:15,837 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:46:16,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 08:46:16,038 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:16,039 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-25 08:46:16,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:46:16,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336993981] [2019-11-25 08:46:16,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:16,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:46:16,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:16,175 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:46:16,175 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:46:16,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:46:16,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336993981] [2019-11-25 08:46:16,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:16,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-25 08:46:16,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836224219] [2019-11-25 08:46:16,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:46:16,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:46:16,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:46:16,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:46:16,251 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-25 08:46:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:16,342 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-25 08:46:16,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:46:16,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-25 08:46:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:16,345 INFO L225 Difference]: With dead ends: 45 [2019-11-25 08:46:16,345 INFO L226 Difference]: Without dead ends: 27 [2019-11-25 08:46:16,346 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:46:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-25 08:46:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-25 08:46:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-25 08:46:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-25 08:46:16,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-25 08:46:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:16,350 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-25 08:46:16,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:46:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-25 08:46:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:46:16,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:16,351 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:46:16,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 08:46:16,564 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-25 08:46:16,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:46:16,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52312800] [2019-11-25 08:46:16,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/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:46:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:16,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 08:46:16,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:46:16,765 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:46:16,765 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:46:16,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:46:17,003 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:46:17,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52312800] [2019-11-25 08:46:17,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:17,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-25 08:46:17,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455570842] [2019-11-25 08:46:17,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-25 08:46:17,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:46:17,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 08:46:17,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:46:17,005 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-25 08:46:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:17,264 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-25 08:46:17,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:46:17,265 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-25 08:46:17,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:17,265 INFO L225 Difference]: With dead ends: 27 [2019-11-25 08:46:17,266 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:46:17,266 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:46:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:46:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:46:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:46:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:46:17,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-25 08:46:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:17,267 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:46:17,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-25 08:46:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:46:17,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:46:17,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 08:46:17,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:46:17,664 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-11-25 08:46:17,857 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-25 08:46:17,857 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-11-25 08:46:17,857 INFO L440 ceAbstractionStarter]: At program point L69(lines 60 70) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3))))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-25 08:46:17,857 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-11-25 08:46:17,857 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 36 47) no Hoare annotation was computed. [2019-11-25 08:46:17,857 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:46:17,858 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:46:17,858 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 55) no Hoare annotation was computed. [2019-11-25 08:46:17,858 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2019-11-25 08:46:17,858 INFO L440 ceAbstractionStarter]: At program point L63-2(lines 63 67) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-25 08:46:17,858 INFO L444 ceAbstractionStarter]: For program point L63-3(lines 63 67) no Hoare annotation was computed. [2019-11-25 08:46:17,858 INFO L440 ceAbstractionStarter]: At program point L47(lines 23 48) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.neg (_ +zero 11 53))))) (= ULTIMATE.start_fmax_double_~x .cse0) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-25 08:46:17,858 INFO L440 ceAbstractionStarter]: At program point L47-1(lines 23 48) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-25 08:46:17,858 INFO L444 ceAbstractionStarter]: For program point L39(lines 39 47) no Hoare annotation was computed. [2019-11-25 08:46:17,858 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 39 47) no Hoare annotation was computed. [2019-11-25 08:46:17,858 INFO L447 ceAbstractionStarter]: At program point L89(lines 72 90) the Hoare annotation is: true [2019-11-25 08:46:17,858 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:46:17,859 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-25 08:46:17,859 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2019-11-25 08:46:17,859 INFO L444 ceAbstractionStarter]: For program point L57-2(line 57) no Hoare annotation was computed. [2019-11-25 08:46:17,859 INFO L440 ceAbstractionStarter]: At program point L57-3(lines 50 58) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-25 08:46:17,859 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:46:17,859 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 31) no Hoare annotation was computed. [2019-11-25 08:46:17,859 INFO L440 ceAbstractionStarter]: At program point L26-2(lines 26 31) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmax_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-25 08:46:17,860 INFO L444 ceAbstractionStarter]: For program point L26-3(lines 23 48) no Hoare annotation was computed. [2019-11-25 08:46:17,860 INFO L444 ceAbstractionStarter]: For program point L26-5(lines 26 31) no Hoare annotation was computed. [2019-11-25 08:46:17,860 INFO L440 ceAbstractionStarter]: At program point L26-6(lines 26 31) the Hoare annotation is: (and (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-25 08:46:17,860 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-25 08:46:17,860 INFO L444 ceAbstractionStarter]: For program point L26-7(lines 23 48) no Hoare annotation was computed. [2019-11-25 08:46:17,860 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 84 87) no Hoare annotation was computed. [2019-11-25 08:46:17,860 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-25 08:46:17,860 INFO L444 ceAbstractionStarter]: For program point L43-1(lines 43 47) no Hoare annotation was computed. [2019-11-25 08:46:17,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:17,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:17,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:17,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:17,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:17,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:17,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:17,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:17,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:17,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:46:17 BoogieIcfgContainer [2019-11-25 08:46:17,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:46:17,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:46:17,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:46:17,894 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:46:17,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:13" (3/4) ... [2019-11-25 08:46:17,897 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:46:17,908 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-25 08:46:17,909 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 08:46:17,909 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 08:46:17,934 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-25 08:46:17,934 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-25 08:46:17,935 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() [2019-11-25 08:46:17,935 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]))) && x == ~Pluszero~LONGDOUBLE() [2019-11-25 08:46:17,935 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-25 08:46:17,968 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e9f4cf9a-31ad-4a96-a07f-2a79b50ce71c/bin/uautomizer/witness.graphml [2019-11-25 08:46:17,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:46:17,969 INFO L168 Benchmark]: Toolchain (without parser) took 5840.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -232.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:46:17,970 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:46:17,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.81 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 944.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:17,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:17,971 INFO L168 Benchmark]: Boogie Preprocessor took 49.07 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:46:17,972 INFO L168 Benchmark]: RCFGBuilder took 501.38 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:17,972 INFO L168 Benchmark]: TraceAbstraction took 4822.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.0 MB). Peak memory consumption was 287.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:17,972 INFO L168 Benchmark]: Witness Printer took 74.58 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:17,974 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.81 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 944.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.07 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 501.38 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4822.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.0 MB). Peak memory consumption was 287.4 MB. Max. memory is 11.5 GB. * Witness Printer took 74.58 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2019-11-25 08:46:17,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-25 08:46:17,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 60]: Loop Invariant [2019-11-25 08:46:18,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:18,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:18,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:18,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:18,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:18,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:18,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-25 08:46:18,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] Derived loop invariant: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]))) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 50]: Loop Invariant [2019-11-25 08:46:18,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 63]: Loop Invariant [2019-11-25 08:46:18,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 23]: Loop Invariant [2019-11-25 08:46:18,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-25 08:46:18,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 4.7s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s 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, 205 HoareAnnotationTreeSize, 8 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 30 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, 18200 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...