./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i --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_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i -s /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 8571d6e044ba86c3b82c24f6ff451bf497f2aedf ....................................................................................................................................................................................................................... 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_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i -s /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 8571d6e044ba86c3b82c24f6ff451bf497f2aedf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:53:13,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:53:13,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:53:13,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:53:13,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:53:13,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:53:13,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:53:13,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:53:13,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:53:13,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:53:13,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:53:13,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:53:13,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:53:13,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:53:13,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:53:13,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:53:13,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:53:13,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:53:13,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:53:13,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:53:13,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:53:13,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:53:13,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:53:13,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:53:13,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:53:13,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:53:13,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:53:13,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:53:13,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:53:13,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:53:13,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:53:13,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:53:13,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:53:13,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:53:13,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:53:13,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:53:13,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:53:13,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:53:13,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:53:13,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:53:13,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:53:13,239 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:53:13,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:53:13,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:53:13,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:53:13,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:53:13,267 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:53:13,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:53:13,268 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:53:13,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:53:13,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:53:13,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:53:13,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:53:13,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:53:13,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:53:13,269 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:53:13,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:53:13,270 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:53:13,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:53:13,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:53:13,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:53:13,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:53:13,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:53:13,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:53:13,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:53:13,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:53:13,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:53:13,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:53:13,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:53:13,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:53:13,273 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_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 -> 8571d6e044ba86c3b82c24f6ff451bf497f2aedf [2019-11-20 03:53:13,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:53:13,446 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:53:13,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:53:13,451 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:53:13,451 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:53:13,452 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2019-11-20 03:53:13,510 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data/7c95d9695/6160d90eb2d448ebb8daea734d871a2f/FLAGd454fc885 [2019-11-20 03:53:13,880 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:53:13,880 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2019-11-20 03:53:13,886 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data/7c95d9695/6160d90eb2d448ebb8daea734d871a2f/FLAGd454fc885 [2019-11-20 03:53:14,267 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data/7c95d9695/6160d90eb2d448ebb8daea734d871a2f [2019-11-20 03:53:14,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:53:14,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:53:14,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:53:14,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:53:14,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:53:14,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b3a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14, skipping insertion in model container [2019-11-20 03:53:14,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,291 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:53:14,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:53:14,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:53:14,458 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:53:14,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:53:14,563 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:53:14,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14 WrapperNode [2019-11-20 03:53:14,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:53:14,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:53:14,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:53:14,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:53:14,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:53:14,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:53:14,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:53:14,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:53:14,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... [2019-11-20 03:53:14,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:53:14,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:53:14,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:53:14,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:53:14,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 03:53:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:53:14,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:53:14,891 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:53:14,891 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:53:14,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:53:14 BoogieIcfgContainer [2019-11-20 03:53:14,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:53:14,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:53:14,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:53:14,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:53:14,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:53:14" (1/3) ... [2019-11-20 03:53:14,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7037cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:53:14, skipping insertion in model container [2019-11-20 03:53:14,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:14" (2/3) ... [2019-11-20 03:53:14,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7037cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:53:14, skipping insertion in model container [2019-11-20 03:53:14,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:53:14" (3/3) ... [2019-11-20 03:53:14,904 INFO L109 eAbstractionObserver]: Analyzing ICFG Double_div.i [2019-11-20 03:53:14,916 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:53:14,923 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:53:14,937 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:53:14,964 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:53:14,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:53:14,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:53:14,965 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:53:14,965 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:53:14,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:53:14,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:53:14,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:53:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-11-20 03:53:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 03:53:14,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:53:14,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 03:53:14,990 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:53:14,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:53:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-11-20 03:53:15,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:53:15,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939910644] [2019-11-20 03:53:15,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:53:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:53:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:53:15,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:53:15,126 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 03:53:15,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:53:15 BoogieIcfgContainer [2019-11-20 03:53:15,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:53:15,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:53:15,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:53:15,144 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:53:15,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:53:14" (3/4) ... [2019-11-20 03:53:15,149 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 03:53:15,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:53:15,152 INFO L168 Benchmark]: Toolchain (without parser) took 879.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:53:15,153 INFO L168 Benchmark]: CDTParser took 0.20 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 03:53:15,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:53:15,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.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 03:53:15,155 INFO L168 Benchmark]: Boogie Preprocessor took 23.13 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 03:53:15,156 INFO L168 Benchmark]: RCFGBuilder took 266.86 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:53:15,157 INFO L168 Benchmark]: TraceAbstraction took 250.02 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:53:15,158 INFO L168 Benchmark]: Witness Printer took 5.69 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 03:53:15,161 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.20 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 290.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.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 23.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 266.86 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 250.02 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.69 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: 2]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 18, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L9] double x = 1.0; [L10] double x1 = x/2.5; [L12] COND FALSE !(x1 != x) [L2] COND TRUE !(cond) [L2] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 03:53:17,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:53:17,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:53:17,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:53:17,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:53:17,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:53:17,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:53:17,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:53:17,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:53:17,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:53:17,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:53:17,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:53:17,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:53:17,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:53:17,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:53:17,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:53:17,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:53:17,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:53:17,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:53:17,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:53:17,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:53:17,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:53:17,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:53:17,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:53:17,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:53:17,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:53:17,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:53:17,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:53:17,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:53:17,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:53:17,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:53:17,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:53:17,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:53:17,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:53:17,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:53:17,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:53:17,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:53:17,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:53:17,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:53:17,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:53:17,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:53:17,319 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 03:53:17,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:53:17,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:53:17,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:53:17,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:53:17,337 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:53:17,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:53:17,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:53:17,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:53:17,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:53:17,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:53:17,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:53:17,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:53:17,343 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:53:17,343 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:53:17,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:53:17,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:53:17,345 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:53:17,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:53:17,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:53:17,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:53:17,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:53:17,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:53:17,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:53:17,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:53:17,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:53:17,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:53:17,349 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 03:53:17,350 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:53:17,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:53:17,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:53:17,350 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_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 -> 8571d6e044ba86c3b82c24f6ff451bf497f2aedf [2019-11-20 03:53:17,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:53:17,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:53:17,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:53:17,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:53:17,660 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:53:17,662 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2019-11-20 03:53:17,731 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data/1b0b6f95c/494af30b2309456ab0091281d24f6ef0/FLAG63f2d3832 [2019-11-20 03:53:18,162 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:53:18,162 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2019-11-20 03:53:18,168 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data/1b0b6f95c/494af30b2309456ab0091281d24f6ef0/FLAG63f2d3832 [2019-11-20 03:53:18,605 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/bin/uautomizer/data/1b0b6f95c/494af30b2309456ab0091281d24f6ef0 [2019-11-20 03:53:18,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:53:18,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:53:18,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:53:18,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:53:18,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:53:18,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d60572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18, skipping insertion in model container [2019-11-20 03:53:18,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,624 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:53:18,639 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:53:18,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:53:18,818 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:53:18,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:53:18,849 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:53:18,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18 WrapperNode [2019-11-20 03:53:18,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:53:18,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:53:18,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:53:18,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:53:18,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:53:18,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:53:18,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:53:18,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:53:18,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... [2019-11-20 03:53:18,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:53:18,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:53:18,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:53:18,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:53:18,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 03:53:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:53:19,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:53:21,352 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:53:21,352 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:53:21,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:53:21 BoogieIcfgContainer [2019-11-20 03:53:21,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:53:21,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:53:21,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:53:21,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:53:21,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:53:18" (1/3) ... [2019-11-20 03:53:21,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e3dd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:53:21, skipping insertion in model container [2019-11-20 03:53:21,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:18" (2/3) ... [2019-11-20 03:53:21,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e3dd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:53:21, skipping insertion in model container [2019-11-20 03:53:21,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:53:21" (3/3) ... [2019-11-20 03:53:21,363 INFO L109 eAbstractionObserver]: Analyzing ICFG Double_div.i [2019-11-20 03:53:21,373 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:53:21,381 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:53:21,393 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:53:21,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:53:21,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:53:21,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:53:21,414 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:53:21,414 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:53:21,414 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:53:21,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:53:21,415 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:53:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-11-20 03:53:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 03:53:21,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:53:21,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 03:53:21,431 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:53:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:53:21,435 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-11-20 03:53:21,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:53:21,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743742209] [2019-11-20 03:53:21,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 03:53:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:53:21,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:53:21,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:53:22,729 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 03:53:22,751 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 03:53:22,751 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:53:24,622 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 03:53:24,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743742209] [2019-11-20 03:53:24,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:53:24,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 03:53:24,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144937428] [2019-11-20 03:53:24,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:53:24,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:53:24,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:53:24,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:53:24,644 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2019-11-20 03:53:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:53:30,673 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-11-20 03:53:30,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:53:30,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-20 03:53:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:53:30,686 INFO L225 Difference]: With dead ends: 20 [2019-11-20 03:53:30,686 INFO L226 Difference]: Without dead ends: 8 [2019-11-20 03:53:30,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:53:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-20 03:53:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-20 03:53:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 03:53:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-11-20 03:53:30,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-11-20 03:53:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:53:30,732 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-11-20 03:53:30,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:53:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-11-20 03:53:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 03:53:30,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:53:30,733 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-11-20 03:53:30,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 03:53:30,951 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:53:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:53:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 1 times [2019-11-20 03:53:30,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:53:30,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389274171] [2019-11-20 03:53:30,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 03:53:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:53:31,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:53:31,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:53:38,655 WARN L191 SmtUtils]: Spent 3.01 s on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 03:53:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:53:38,659 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:53:55,437 WARN L191 SmtUtils]: Spent 2.91 s on a formula simplification that was a NOOP. DAG size: 7 [2019-11-20 03:53:57,893 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-11-20 03:54:00,365 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-11-20 03:54:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-11-20 03:54:00,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389274171] [2019-11-20 03:54:00,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:54:00,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-20 03:54:00,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206500901] [2019-11-20 03:54:00,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:54:00,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:54:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:54:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=23, Unknown=6, NotChecked=10, Total=56 [2019-11-20 03:54:00,370 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-11-20 03:54:02,884 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (= c_ULTIMATE.start_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1)))) is different from true [2019-11-20 03:54:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:54:15,454 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-11-20 03:54:15,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:54:15,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-11-20 03:54:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:54:15,456 INFO L225 Difference]: With dead ends: 14 [2019-11-20 03:54:15,456 INFO L226 Difference]: Without dead ends: 10 [2019-11-20 03:54:15,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=8, NotChecked=26, Total=90 [2019-11-20 03:54:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-11-20 03:54:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-20 03:54:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 03:54:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-11-20 03:54:15,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-11-20 03:54:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:54:15,464 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-11-20 03:54:15,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:54:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-11-20 03:54:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 03:54:15,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:54:15,464 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-11-20 03:54:15,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 03:54:15,665 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:54:15,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:54:15,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1174852536, now seen corresponding path program 2 times [2019-11-20 03:54:15,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:54:15,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866288363] [2019-11-20 03:54:15,667 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 03:54:16,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:54:16,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:54:16,582 WARN L253 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 03:54:16,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:54:30,590 WARN L191 SmtUtils]: Spent 5.17 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 03:54:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:54:30,595 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:54:39,323 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2019-11-20 03:54:41,590 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from true [2019-11-20 03:54:44,153 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2019-11-20 03:54:46,702 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-11-20 03:54:49,470 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2019-11-20 03:54:52,237 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-11-20 03:54:55,218 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2019-11-20 03:54:58,244 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-11-20 03:54:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2019-11-20 03:54:58,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866288363] [2019-11-20 03:54:58,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:54:58,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2019-11-20 03:54:58,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685675889] [2019-11-20 03:54:58,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 03:54:58,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:54:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 03:54:58,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=13, NotChecked=76, Total=182 [2019-11-20 03:54:58,248 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 14 states. [2019-11-20 03:55:01,313 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2))) (or (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (fp.eq c_ULTIMATE.start_main_~x~0 .cse2)) (= c_ULTIMATE.start_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1)))) is different from true [2019-11-20 03:55:04,115 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) c_ULTIMATE.start_main_~x1~0) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2019-11-20 03:55:06,669 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x1~0) (let ((.cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2019-11-20 03:55:08,947 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-20 03:55:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:55:15,143 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-11-20 03:55:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:55:15,144 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-11-20 03:55:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:55:15,145 INFO L225 Difference]: With dead ends: 18 [2019-11-20 03:55:15,145 INFO L226 Difference]: Without dead ends: 12 [2019-11-20 03:55:15,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=40, Invalid=85, Unknown=17, NotChecked=200, Total=342 [2019-11-20 03:55:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-20 03:55:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-20 03:55:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-20 03:55:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-11-20 03:55:15,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-11-20 03:55:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:55:15,151 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-11-20 03:55:15,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 03:55:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-11-20 03:55:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:55:15,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:55:15,153 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-11-20 03:55:15,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 03:55:15,359 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:55:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:55:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 3 times [2019-11-20 03:55:15,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:55:15,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371612301] [2019-11-20 03:55:15,360 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_672c0b34-b0e9-4f32-b862-0f1c9cf6e7e0/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 03:55:16,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 03:55:16,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:55:16,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:55:16,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:55:21,750 WARN L191 SmtUtils]: Spent 3.24 s on a formula simplification that was a NOOP. DAG size: 7 [2019-11-20 03:55:24,280 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (= .cse0 c_ULTIMATE.start_main_~x~0)))) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) is different from false [2019-11-20 03:55:26,553 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (= .cse0 c_ULTIMATE.start_main_~x~0)))) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) is different from true [2019-11-20 03:55:29,072 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (= .cse0 c_ULTIMATE.start_main_~x~0)))) (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x~0)) is different from false [2019-11-20 03:55:31,316 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (= .cse0 c_ULTIMATE.start_main_~x~0)))) (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x~0)) is different from true [2019-11-20 03:55:31,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:55:44,275 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 .cse1))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 .cse3))) (and (not (fp.eq .cse2 v_ULTIMATE.start_main_~x~0_14)) (fp.eq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.eq (fp.div roundNearestTiesToEven .cse2 .cse3) .cse2))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2019-11-20 03:55:51,912 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 .cse1))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2019-11-20 03:55:54,369 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 .cse1))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2019-11-20 03:55:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2019-11-20 03:55:54,371 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:05,258 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2019-11-20 03:56:07,521 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from true [2019-11-20 03:56:14,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_16 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_16 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_16) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from false [2019-11-20 03:56:17,492 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_16 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_16 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_16) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2019-11-20 03:56:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 11 not checked. [2019-11-20 03:56:37,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371612301] [2019-11-20 03:56:37,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:37,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-11-20 03:56:37,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901354156] [2019-11-20 03:56:37,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:56:37,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:56:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=20, Unknown=12, NotChecked=78, Total=132 [2019-11-20 03:56:37,675 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-11-20 03:56:39,939 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (fp.eq c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0) (forall ((v_ULTIMATE.start_main_~x~0_16 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_16 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_16) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from false [2019-11-20 03:56:42,458 WARN L860 $PredicateComparison]: unable to prove that (and (or (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (fp.eq c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0) (forall ((v_ULTIMATE.start_main_~x~0_16 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_16 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_16) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from true [2019-11-20 03:56:45,652 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse1 v_ULTIMATE.start_main_~x~0_14)) (= .cse1 c_ULTIMATE.start_main_~x~0)))) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 .cse0) c_ULTIMATE.start_main_~x1~0) (forall ((v_ULTIMATE.start_main_~x~0_16 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_16 .cse3))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse2 .cse3) .cse2)) (fp.eq .cse2 v_ULTIMATE.start_main_~x~0_16) (fp.eq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))))) is different from false [2019-11-20 03:56:48,584 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse1 v_ULTIMATE.start_main_~x~0_14)) (= .cse1 c_ULTIMATE.start_main_~x~0)))) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 .cse0) c_ULTIMATE.start_main_~x1~0) (forall ((v_ULTIMATE.start_main_~x~0_16 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_16 .cse3))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse2 .cse3) .cse2)) (fp.eq .cse2 v_ULTIMATE.start_main_~x~0_16) (fp.eq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))))) is different from true [2019-11-20 03:56:51,685 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or .cse0 (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 .cse2)) (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse3 v_ULTIMATE.start_main_~x~0_14)) (= .cse3 c_ULTIMATE.start_main_~x~0)))) (or (not .cse0) (fp.eq c_ULTIMATE.start_main_~x~0 .cse2)) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 .cse1) c_ULTIMATE.start_main_~x1~0) (forall ((v_ULTIMATE.start_main_~x~0_16 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse4 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_16 .cse5))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse4 .cse5) .cse4)) (fp.eq .cse4 v_ULTIMATE.start_main_~x~0_16) (fp.eq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))))) is different from false [2019-11-20 03:56:54,516 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or .cse0 (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 .cse2)) (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse3 v_ULTIMATE.start_main_~x~0_14)) (= .cse3 c_ULTIMATE.start_main_~x~0)))) (or (not .cse0) (fp.eq c_ULTIMATE.start_main_~x~0 .cse2)) (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 .cse1) c_ULTIMATE.start_main_~x1~0) (forall ((v_ULTIMATE.start_main_~x~0_16 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse4 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_16 .cse5))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse4 .cse5) .cse4)) (fp.eq .cse4 v_ULTIMATE.start_main_~x~0_16) (fp.eq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))))) is different from true [2019-11-20 03:56:57,045 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (= .cse0 c_ULTIMATE.start_main_~x~0)))) (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x~0) (fp.eq c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2019-11-20 03:56:59,295 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (= .cse0 c_ULTIMATE.start_main_~x~0)))) (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~x~0) (fp.eq c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from true [2019-11-20 03:57:01,750 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (or (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 .cse1))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_14)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) .cse2) (and (exists ((v_ULTIMATE.start_main_~x~0_14 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_14 .cse4))) (and (not (fp.eq .cse3 v_ULTIMATE.start_main_~x~0_14)) (fp.eq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse4) .cse3))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) (not .cse2))) is different from false [2019-11-20 03:57:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:57:01,757 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-11-20 03:57:01,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:57:01,757 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-11-20 03:57:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:57:01,757 INFO L225 Difference]: With dead ends: 12 [2019-11-20 03:57:01,758 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:57:01,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.0s TimeCoverageRelationStatistics Valid=32, Invalid=21, Unknown=21, NotChecked=198, Total=272 [2019-11-20 03:57:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:57:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:57:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:57:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:57:01,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-11-20 03:57:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:57:01,759 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:57:01,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:57:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:57:01,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:57:01,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 03:57:01,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:58:07,124 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 03:58:07,125 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:92) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:53) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:737) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walkParam(SimplifyDDA.java:526) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:412) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplifyWithStatistics(SmtUtils.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.(HoareAnnotationComposer.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeCFGHoareAnnotation(BasicCegarLoop.java:1008) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 34 more [2019-11-20 03:58:07,129 INFO L168 Benchmark]: Toolchain (without parser) took 288520.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 951.1 MB in the beginning and 1.0 GB in the end (delta: -65.4 MB). Peak memory consumption was 92.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:07,129 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 976.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:58:07,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.39 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:07,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -221.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:07,130 INFO L168 Benchmark]: Boogie Preprocessor took 31.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:07,131 INFO L168 Benchmark]: RCFGBuilder took 2382.50 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: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:07,131 INFO L168 Benchmark]: TraceAbstraction took 285772.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.1 MB). Peak memory consumption was 115.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:07,134 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 976.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.39 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -221.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2382.50 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: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 285772.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.1 MB). Peak memory consumption was 115.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...