./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4284cb37841cd94fe17da64cc250a8a1e69c6375 ............................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4284cb37841cd94fe17da64cc250a8a1e69c6375 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 04:15:07,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:15:07,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:15:07,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:15:07,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:15:07,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:15:07,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:15:07,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:15:07,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:15:07,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:15:07,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:15:07,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:15:07,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:15:07,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:15:07,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:15:07,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:15:07,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:15:07,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:15:07,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:15:07,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:15:07,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:15:07,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:15:07,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:15:07,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:15:07,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:15:07,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:15:07,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:15:07,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:15:07,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:15:07,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:15:07,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:15:07,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:15:07,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:15:07,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:15:07,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:15:07,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:15:07,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:15:07,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:15:07,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:15:07,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:15:07,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:15:07,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 04:15:07,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:15:07,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:15:07,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:15:07,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:15:07,556 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:15:07,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:15:07,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:15:07,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:15:07,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:15:07,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:15:07,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:15:07,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:15:07,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:15:07,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:15:07,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:15:07,560 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:15:07,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:15:07,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:15:07,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:15:07,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:15:07,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:15:07,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:15:07,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:15:07,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:15:07,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:15:07,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:15:07,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:15:07,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:15:07,563 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_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-20 04:15:07,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:15:07,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:15:07,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:15:07,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:15:07,716 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:15:07,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-20 04:15:07,782 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data/02927e1dd/0bd40b387bc241e0a5f7e4414c1910a0/FLAGd2fae9928 [2019-11-20 04:15:08,151 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:15:08,153 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-20 04:15:08,160 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data/02927e1dd/0bd40b387bc241e0a5f7e4414c1910a0/FLAGd2fae9928 [2019-11-20 04:15:08,494 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data/02927e1dd/0bd40b387bc241e0a5f7e4414c1910a0 [2019-11-20 04:15:08,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:15:08,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:15:08,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:15:08,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:15:08,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:15:08,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6210288c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08, skipping insertion in model container [2019-11-20 04:15:08,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,525 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:15:08,542 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:15:08,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:15:08,836 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:15:08,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:15:08,897 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:15:08,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08 WrapperNode [2019-11-20 04:15:08,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:15:08,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:15:08,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:15:08,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:15:08,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:15:08,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:15:08,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:15:08,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:15:08,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... [2019-11-20 04:15:08,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:15:08,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:15:08,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:15:08,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:15:08,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:15:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:15:09,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 04:15:09,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:15:09,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:15:09,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 04:15:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 04:15:09,360 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:15:09,360 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-20 04:15:09,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:15:09 BoogieIcfgContainer [2019-11-20 04:15:09,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:15:09,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:15:09,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:15:09,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:15:09,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:15:08" (1/3) ... [2019-11-20 04:15:09,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ded89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:15:09, skipping insertion in model container [2019-11-20 04:15:09,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:08" (2/3) ... [2019-11-20 04:15:09,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ded89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:15:09, skipping insertion in model container [2019-11-20 04:15:09,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:15:09" (3/3) ... [2019-11-20 04:15:09,370 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-20 04:15:09,378 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:15:09,384 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:15:09,394 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:15:09,416 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:15:09,416 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:15:09,416 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:15:09,416 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:15:09,417 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:15:09,417 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:15:09,417 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:15:09,417 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:15:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-20 04:15:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 04:15:09,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:09,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:15:09,468 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:09,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-20 04:15:09,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:15:09,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671021748] [2019-11-20 04:15:09,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:15:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:09,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671021748] [2019-11-20 04:15:09,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:09,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:15:09,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638918430] [2019-11-20 04:15:09,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 04:15:09,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:15:09,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 04:15:09,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 04:15:09,600 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-20 04:15:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:09,617 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-20 04:15:09,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 04:15:09,618 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-20 04:15:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:09,628 INFO L225 Difference]: With dead ends: 62 [2019-11-20 04:15:09,628 INFO L226 Difference]: Without dead ends: 29 [2019-11-20 04:15:09,631 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-20 04:15:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-20 04:15:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-20 04:15:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 04:15:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-20 04:15:09,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-20 04:15:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:09,666 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-20 04:15:09,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 04:15:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-20 04:15:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 04:15:09,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:09,667 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:15:09,667 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-20 04:15:09,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:15:09,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287208645] [2019-11-20 04:15:09,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:15:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:09,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287208645] [2019-11-20 04:15:09,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:09,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:15:09,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959032290] [2019-11-20 04:15:09,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:15:09,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:15:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:15:09,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:15:09,760 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-20 04:15:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:09,831 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-20 04:15:09,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:15:09,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 04:15:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:09,832 INFO L225 Difference]: With dead ends: 53 [2019-11-20 04:15:09,833 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 04:15:09,833 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-20 04:15:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 04:15:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-20 04:15:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 04:15:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-20 04:15:09,840 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-20 04:15:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:09,841 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-20 04:15:09,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:15:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-20 04:15:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 04:15:09,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:09,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:15:09,842 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-20 04:15:09,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:15:09,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907010180] [2019-11-20 04:15:09,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:15:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:09,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907010180] [2019-11-20 04:15:09,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:09,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:15:09,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437576430] [2019-11-20 04:15:09,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:15:09,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:15:09,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:15:09,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:15:09,903 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-20 04:15:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:09,958 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-20 04:15:09,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:15:09,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 04:15:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:09,960 INFO L225 Difference]: With dead ends: 55 [2019-11-20 04:15:09,960 INFO L226 Difference]: Without dead ends: 46 [2019-11-20 04:15:09,961 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-20 04:15:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-20 04:15:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-20 04:15:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 04:15:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-20 04:15:09,966 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-20 04:15:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:09,967 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-20 04:15:09,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:15:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-20 04:15:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 04:15:09,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:09,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:15:09,968 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-20 04:15:09,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:15:09,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889174765] [2019-11-20 04:15:09,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:15:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:15:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:15:10,043 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:15:10,045 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 04:15:10,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:15:10 BoogieIcfgContainer [2019-11-20 04:15:10,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:15:10,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:15:10,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:15:10,076 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:15:10,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:15:09" (3/4) ... [2019-11-20 04:15:10,079 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 04:15:10,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:15:10,082 INFO L168 Benchmark]: Toolchain (without parser) took 1583.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -110.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:10,083 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:15:10,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:10,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:15:10,086 INFO L168 Benchmark]: Boogie Preprocessor took 38.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:10,087 INFO L168 Benchmark]: RCFGBuilder took 380.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:10,090 INFO L168 Benchmark]: TraceAbstraction took 712.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:10,090 INFO L168 Benchmark]: Witness Printer took 3.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:15:10,092 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.62 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 38.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 380.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 712.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 75. Possible FailurePath: [L74] double x = 0.0; [L75] double y = -0.0; [L19] __uint32_t msw, lsw; [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 04:15:11,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:15:11,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:15:11,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:15:11,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:15:11,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:15:11,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:15:11,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:15:11,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:15:11,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:15:11,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:15:11,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:15:11,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:15:11,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:15:11,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:15:11,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:15:11,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:15:11,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:15:11,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:15:11,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:15:11,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:15:11,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:15:11,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:15:11,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:15:11,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:15:11,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:15:11,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:15:11,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:15:11,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:15:11,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:15:11,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:15:11,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:15:11,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:15:11,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:15:11,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:15:11,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:15:11,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:15:11,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:15:11,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:15:11,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:15:11,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:15:11,986 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 04:15:12,017 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:15:12,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:15:12,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:15:12,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:15:12,021 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:15:12,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:15:12,022 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:15:12,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:15:12,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:15:12,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:15:12,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:15:12,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:15:12,024 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 04:15:12,024 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 04:15:12,025 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:15:12,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:15:12,025 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:15:12,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:15:12,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:15:12,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:15:12,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:15:12,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:15:12,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:15:12,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:15:12,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:15:12,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:15:12,028 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 04:15:12,028 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 04:15:12,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:15:12,029 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 04:15:12,029 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_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-20 04:15:12,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:15:12,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:15:12,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:15:12,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:15:12,318 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:15:12,319 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-20 04:15:12,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data/1412f5b3e/c5c0123a47164b3f9fd622345d8c70a7/FLAG52e0be761 [2019-11-20 04:15:12,725 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:15:12,725 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-20 04:15:12,732 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data/1412f5b3e/c5c0123a47164b3f9fd622345d8c70a7/FLAG52e0be761 [2019-11-20 04:15:13,102 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/data/1412f5b3e/c5c0123a47164b3f9fd622345d8c70a7 [2019-11-20 04:15:13,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:15:13,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:15:13,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:15:13,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:15:13,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:15:13,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb9dbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13, skipping insertion in model container [2019-11-20 04:15:13,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,125 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:15:13,142 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:15:13,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:15:13,360 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:15:13,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:15:13,444 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:15:13,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13 WrapperNode [2019-11-20 04:15:13,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:15:13,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:15:13,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:15:13,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:15:13,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:15:13,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:15:13,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:15:13,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:15:13,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... [2019-11-20 04:15:13,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:15:13,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:15:13,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:15:13,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:15:13,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:15:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 04:15:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:15:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 04:15:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:15:13,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:15:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 04:15:14,117 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:15:14,117 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-20 04:15:14,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:15:14 BoogieIcfgContainer [2019-11-20 04:15:14,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:15:14,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:15:14,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:15:14,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:15:14,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:15:13" (1/3) ... [2019-11-20 04:15:14,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bd4670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:15:14, skipping insertion in model container [2019-11-20 04:15:14,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:15:13" (2/3) ... [2019-11-20 04:15:14,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bd4670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:15:14, skipping insertion in model container [2019-11-20 04:15:14,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:15:14" (3/3) ... [2019-11-20 04:15:14,125 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-20 04:15:14,134 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:15:14,142 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:15:14,152 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:15:14,173 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:15:14,173 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:15:14,173 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:15:14,174 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:15:14,174 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:15:14,174 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:15:14,174 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:15:14,174 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:15:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-20 04:15:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 04:15:14,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:14,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:15:14,194 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-20 04:15:14,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:15:14,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97836855] [2019-11-20 04:15:14,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/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-20 04:15:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:14,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 04:15:14,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:15:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:14,312 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:15:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:14,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97836855] [2019-11-20 04:15:14,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:14,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 04:15:14,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98858288] [2019-11-20 04:15:14,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 04:15:14,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:15:14,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 04:15:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 04:15:14,335 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-20 04:15:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:14,351 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-20 04:15:14,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 04:15:14,352 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-20 04:15:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:14,361 INFO L225 Difference]: With dead ends: 62 [2019-11-20 04:15:14,362 INFO L226 Difference]: Without dead ends: 29 [2019-11-20 04:15:14,365 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-20 04:15:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-20 04:15:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-20 04:15:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 04:15:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-20 04:15:14,393 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-20 04:15:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:14,393 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-20 04:15:14,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 04:15:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-20 04:15:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 04:15:14,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:14,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:15:14,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 04:15:14,597 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-20 04:15:14,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:15:14,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657263930] [2019-11-20 04:15:14,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/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-20 04:15:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:14,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:15:14,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:15:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:14,726 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:15:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:14,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657263930] [2019-11-20 04:15:14,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:14,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 04:15:14,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525542936] [2019-11-20 04:15:14,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 04:15:14,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:15:14,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:15:14,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:15:14,759 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-20 04:15:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:14,879 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-20 04:15:14,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:15:14,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-20 04:15:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:14,881 INFO L225 Difference]: With dead ends: 68 [2019-11-20 04:15:14,882 INFO L226 Difference]: Without dead ends: 59 [2019-11-20 04:15:14,883 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-20 04:15:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-20 04:15:14,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-20 04:15:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 04:15:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-20 04:15:14,890 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-20 04:15:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:14,890 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-20 04:15:14,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 04:15:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-20 04:15:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 04:15:14,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:14,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:15:15,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 04:15:15,114 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:15,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:15,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-20 04:15:15,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:15:15,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383005240] [2019-11-20 04:15:15,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/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-20 04:15:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:15,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 04:15:15,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:15:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:15,264 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:15:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:15,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383005240] [2019-11-20 04:15:15,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:15,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 04:15:15,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596189153] [2019-11-20 04:15:15,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 04:15:15,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:15:15,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:15:15,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:15:15,319 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-20 04:15:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:15,442 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-20 04:15:15,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:15:15,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 04:15:15,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:15,446 INFO L225 Difference]: With dead ends: 52 [2019-11-20 04:15:15,446 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 04:15:15,446 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-20 04:15:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 04:15:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-20 04:15:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 04:15:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-20 04:15:15,450 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-20 04:15:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:15,450 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-20 04:15:15,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 04:15:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-20 04:15:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 04:15:15,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:15,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:15:15,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 04:15:15,652 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:15,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-20 04:15:15,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:15:15,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563643432] [2019-11-20 04:15:15,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/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-20 04:15:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:15,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:15:15,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:15:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:15,769 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:15:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:15,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563643432] [2019-11-20 04:15:15,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:15,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 04:15:15,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515050355] [2019-11-20 04:15:15,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 04:15:15,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:15:15,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:15:15,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:15:15,803 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-20 04:15:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:15,903 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-20 04:15:15,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:15:15,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 04:15:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:15,905 INFO L225 Difference]: With dead ends: 65 [2019-11-20 04:15:15,905 INFO L226 Difference]: Without dead ends: 56 [2019-11-20 04:15:15,906 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-20 04:15:15,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-20 04:15:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-20 04:15:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 04:15:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-20 04:15:15,915 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-20 04:15:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:15,915 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-20 04:15:15,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 04:15:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-20 04:15:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 04:15:15,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:15,919 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-20 04:15:16,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 04:15:16,133 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:16,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-20 04:15:16,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:15:16,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540320453] [2019-11-20 04:15:16,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/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-20 04:15:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:16,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 04:15:16,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:15:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:16,275 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:15:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:16,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540320453] [2019-11-20 04:15:16,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:16,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 04:15:16,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648968770] [2019-11-20 04:15:16,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:15:16,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:15:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:15:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:15:16,317 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-20 04:15:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:16,330 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-20 04:15:16,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:15:16,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 04:15:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:16,335 INFO L225 Difference]: With dead ends: 40 [2019-11-20 04:15:16,335 INFO L226 Difference]: Without dead ends: 30 [2019-11-20 04:15:16,335 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-20 04:15:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-20 04:15:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-20 04:15:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 04:15:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-20 04:15:16,340 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-20 04:15:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:16,340 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-20 04:15:16,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:15:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-20 04:15:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 04:15:16,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:16,342 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-20 04:15:16,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 04:15:16,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-20 04:15:16,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:15:16,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083785316] [2019-11-20 04:15:16,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/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-20 04:15:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:16,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:15:16,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:15:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:16,728 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:15:16,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:15:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:16,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083785316] [2019-11-20 04:15:16,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:16,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-20 04:15:16,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312428975] [2019-11-20 04:15:16,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 04:15:16,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:15:16,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 04:15:16,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 04:15:16,800 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-20 04:15:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:16,946 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-20 04:15:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 04:15:16,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-20 04:15:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:16,948 INFO L225 Difference]: With dead ends: 42 [2019-11-20 04:15:16,948 INFO L226 Difference]: Without dead ends: 39 [2019-11-20 04:15:16,949 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-20 04:15:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-20 04:15:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-20 04:15:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 04:15:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-20 04:15:16,954 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-20 04:15:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:16,955 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-20 04:15:16,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 04:15:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-20 04:15:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 04:15:16,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:16,956 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-20 04:15:17,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 04:15:17,157 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-20 04:15:17,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:15:17,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963281482] [2019-11-20 04:15:17,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/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-20 04:15:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:17,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 04:15:17,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:15:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:17,313 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:15:17,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:15:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:17,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963281482] [2019-11-20 04:15:17,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:17,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 04:15:17,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278755941] [2019-11-20 04:15:17,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 04:15:17,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:15:17,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 04:15:17,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:15:17,467 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-20 04:15:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:17,603 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-20 04:15:17,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:15:17,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-20 04:15:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:17,608 INFO L225 Difference]: With dead ends: 45 [2019-11-20 04:15:17,608 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 04:15:17,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:15:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 04:15:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 04:15:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 04:15:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-20 04:15:17,613 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-20 04:15:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:17,613 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-20 04:15:17,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 04:15:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-20 04:15:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 04:15:17,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:17,615 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-20 04:15:17,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 04:15:17,815 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:17,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-20 04:15:17,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:15:17,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311141385] [2019-11-20 04:15:17,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/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-20 04:15:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:17,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 04:15:17,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:15:18,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:15:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:18,059 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:15:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:15:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:15:18,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311141385] [2019-11-20 04:15:18,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:18,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-20 04:15:18,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474570021] [2019-11-20 04:15:18,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 04:15:18,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:15:18,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 04:15:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:15:18,318 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-20 04:15:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:18,627 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-20 04:15:18,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 04:15:18,628 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-20 04:15:18,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:18,628 INFO L225 Difference]: With dead ends: 27 [2019-11-20 04:15:18,629 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 04:15:18,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-20 04:15:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 04:15:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 04:15:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 04:15:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 04:15:18,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-20 04:15:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:18,630 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:15:18,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 04:15:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:15:18,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 04:15:18,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 04:15:18,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 04:15:19,206 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 04:15:19,206 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 04:15:19,206 INFO L444 ceAbstractionStarter]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2019-11-20 04:15:19,206 INFO L440 ceAbstractionStarter]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-20 04:15:19,206 INFO L444 ceAbstractionStarter]: For program point L21-3(lines 18 43) no Hoare annotation was computed. [2019-11-20 04:15:19,206 INFO L444 ceAbstractionStarter]: For program point L21-5(lines 21 26) no Hoare annotation was computed. [2019-11-20 04:15:19,207 INFO L440 ceAbstractionStarter]: At program point L21-6(lines 21 26) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-20 04:15:19,207 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 04:15:19,207 INFO L444 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2019-11-20 04:15:19,207 INFO L444 ceAbstractionStarter]: For program point L21-7(lines 18 43) no Hoare annotation was computed. [2019-11-20 04:15:19,207 INFO L444 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-11-20 04:15:19,207 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-11-20 04:15:19,207 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2019-11-20 04:15:19,208 INFO L440 ceAbstractionStarter]: At program point L63(lines 54 64) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3)) (fp.neg (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-20 04:15:19,208 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-20 04:15:19,208 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 42) no Hoare annotation was computed. [2019-11-20 04:15:19,208 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 31 42) no Hoare annotation was computed. [2019-11-20 04:15:19,208 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 49) no Hoare annotation was computed. [2019-11-20 04:15:19,208 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 04:15:19,208 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2019-11-20 04:15:19,209 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-20 04:15:19,232 INFO L440 ceAbstractionStarter]: At program point L57-2(lines 57 61) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___fpclassify_double_~x .cse0) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-20 04:15:19,234 INFO L444 ceAbstractionStarter]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2019-11-20 04:15:19,234 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 04:15:19,234 INFO L440 ceAbstractionStarter]: At program point L42(lines 18 43) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-20 04:15:19,234 INFO L440 ceAbstractionStarter]: At program point L42-1(lines 18 43) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-20 04:15:19,235 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-20 04:15:19,235 INFO L444 ceAbstractionStarter]: For program point L34-1(lines 34 42) no Hoare annotation was computed. [2019-11-20 04:15:19,235 INFO L447 ceAbstractionStarter]: At program point L84(lines 66 85) the Hoare annotation is: true [2019-11-20 04:15:19,235 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-20 04:15:19,235 INFO L444 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-11-20 04:15:19,236 INFO L440 ceAbstractionStarter]: At program point L51-3(lines 45 52) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-20 04:15:19,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:15:19 BoogieIcfgContainer [2019-11-20 04:15:19,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:15:19,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:15:19,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:15:19,299 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:15:19,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:15:14" (3/4) ... [2019-11-20 04:15:19,304 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 04:15:19,319 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-20 04:15:19,319 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-20 04:15:19,320 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 04:15:19,350 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() [2019-11-20 04:15:19,350 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-20 04:15:19,351 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-20 04:15:19,352 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-20 04:15:19,352 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-20 04:15:19,386 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_da2f256c-f8e1-4314-9566-d97ea98f40a7/bin/uautomizer/witness.graphml [2019-11-20 04:15:19,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:15:19,388 INFO L168 Benchmark]: Toolchain (without parser) took 6281.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -208.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:15:19,388 INFO L168 Benchmark]: CDTParser took 0.24 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-20 04:15:19,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.90 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 940.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:19,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:19,389 INFO L168 Benchmark]: Boogie Preprocessor took 35.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:15:19,390 INFO L168 Benchmark]: RCFGBuilder took 502.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:19,390 INFO L168 Benchmark]: TraceAbstraction took 5179.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.1 MB). Peak memory consumption was 296.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:19,391 INFO L168 Benchmark]: Witness Printer took 87.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:19,393 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.90 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 940.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 134.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 502.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5179.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.1 MB). Peak memory consumption was 296.4 MB. Max. memory is 11.5 GB. * Witness Printer took 87.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant [2019-11-20 04:15:19,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 04:15:19,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] Derived loop invariant: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 18]: Loop Invariant [2019-11-20 04:15:19,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 04:15:19,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 45]: Loop Invariant [2019-11-20 04:15:19,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 57]: Loop Invariant [2019-11-20 04:15:19,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 18]: Loop Invariant [2019-11-20 04:15:19,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 04:15:19,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 222 HoareAnnotationTreeSize, 8 FomulaSimplifications, 54 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 21300 SizeOfPredicates, 38 NumberOfNonLiveVariables, 465 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...