./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.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_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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 1d363a30f559764c47bcb73d637f2d7196a1b97b ....................................................................................................................................................................................................................... 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_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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 1d363a30f559764c47bcb73d637f2d7196a1b97b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-19 22:57:23,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:57:23,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:57:23,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:57:23,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:57:23,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:57:23,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:57:23,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:57:23,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:57:23,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:57:23,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:57:23,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:57:23,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:57:23,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:57:23,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:57:23,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:57:23,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:57:23,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:57:23,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:57:23,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:57:23,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:57:23,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:57:23,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:57:23,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:57:23,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:57:23,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:57:23,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:57:23,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:57:23,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:57:23,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:57:23,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:57:23,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:57:23,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:57:23,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:57:23,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:57:23,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:57:23,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:57:23,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:57:23,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:57:23,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:57:23,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:57:23,141 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:57:23,170 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:57:23,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:57:23,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:57:23,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:57:23,172 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:57:23,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:57:23,172 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:57:23,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:57:23,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:57:23,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:57:23,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:57:23,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:57:23,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:57:23,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:57:23,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:57:23,174 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:57:23,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:57:23,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:57:23,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:57:23,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:57:23,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:57:23,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:57:23,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:57:23,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:57:23,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:57:23,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:57:23,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:57:23,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:57:23,176 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_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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 -> 1d363a30f559764c47bcb73d637f2d7196a1b97b [2019-11-19 22:57:23,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:57:23,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:57:23,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:57:23,383 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:57:23,383 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:57:23,385 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2019-11-19 22:57:23,447 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data/0f53baf84/131204804fdb4af8903095a294978e80/FLAGe74636aba [2019-11-19 22:57:23,817 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:57:23,818 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2019-11-19 22:57:23,823 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data/0f53baf84/131204804fdb4af8903095a294978e80/FLAGe74636aba [2019-11-19 22:57:24,267 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data/0f53baf84/131204804fdb4af8903095a294978e80 [2019-11-19 22:57:24,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:57:24,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:57:24,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:57:24,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:57:24,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:57:24,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467593ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24, skipping insertion in model container [2019-11-19 22:57:24,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,287 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:57:24,300 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:57:24,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:57:24,480 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:57:24,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:57:24,583 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:57:24,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24 WrapperNode [2019-11-19 22:57:24,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:57:24,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:57:24,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:57:24,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:57:24,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:57:24,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:57:24,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:57:24,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:57:24,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... [2019-11-19 22:57:24,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:57:24,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:57:24,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:57:24,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:57:24,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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-19 22:57:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:57:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:57:24,861 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:57:24,861 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 22:57:24,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:57:24 BoogieIcfgContainer [2019-11-19 22:57:24,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:57:24,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:57:24,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:57:24,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:57:24,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:57:24" (1/3) ... [2019-11-19 22:57:24,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b72a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:57:24, skipping insertion in model container [2019-11-19 22:57:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:24" (2/3) ... [2019-11-19 22:57:24,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b72a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:57:24, skipping insertion in model container [2019-11-19 22:57:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:57:24" (3/3) ... [2019-11-19 22:57:24,870 INFO L109 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i [2019-11-19 22:57:24,879 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:57:24,886 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:57:24,903 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:57:24,932 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:57:24,932 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:57:24,932 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:57:24,932 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:57:24,933 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:57:24,933 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:57:24,933 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:57:24,933 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:57:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-11-19 22:57:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-19 22:57:24,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:57:24,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-19 22:57:24,953 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:57:24,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:57:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-11-19 22:57:24,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:57:24,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492034028] [2019-11-19 22:57:24,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:57:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:57:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:57:25,063 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:57:25,063 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 22:57:25,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:57:25 BoogieIcfgContainer [2019-11-19 22:57:25,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:57:25,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:57:25,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:57:25,076 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:57:25,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:57:24" (3/4) ... [2019-11-19 22:57:25,080 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:57:25,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:57:25,082 INFO L168 Benchmark]: Toolchain (without parser) took 810.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:57:25,083 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:57:25,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:57:25,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.80 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-19 22:57:25,085 INFO L168 Benchmark]: Boogie Preprocessor took 19.81 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-19 22:57:25,085 INFO L168 Benchmark]: RCFGBuilder took 225.79 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: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:57:25,086 INFO L168 Benchmark]: TraceAbstraction took 211.97 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:57:25,087 INFO L168 Benchmark]: Witness Printer took 4.65 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-19 22:57:25,090 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.80 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 19.81 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 225.79 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: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 211.97 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.65 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/1.6; [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-19 22:57:26,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:57:26,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:57:26,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:57:26,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:57:26,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:57:26,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:57:26,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:57:26,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:57:26,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:57:26,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:57:26,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:57:26,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:57:26,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:57:26,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:57:26,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:57:26,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:57:26,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:57:26,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:57:26,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:57:26,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:57:26,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:57:26,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:57:26,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:57:26,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:57:26,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:57:26,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:57:26,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:57:26,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:57:26,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:57:26,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:57:26,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:57:26,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:57:26,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:57:26,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:57:26,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:57:26,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:57:26,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:57:26,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:57:26,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:57:26,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:57:26,944 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 22:57:26,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:57:26,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:57:26,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:57:26,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:57:26,960 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:57:26,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:57:26,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:57:26,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:57:26,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:57:26,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:57:26,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:57:26,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:57:26,963 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:57:26,963 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:57:26,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:57:26,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:57:26,964 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:57:26,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:57:26,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:57:26,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:57:26,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:57:26,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:57:26,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:57:26,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:57:26,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:57:26,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:57:26,966 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:57:26,966 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:57:26,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:57:26,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:57:26,967 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_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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 -> 1d363a30f559764c47bcb73d637f2d7196a1b97b [2019-11-19 22:57:27,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:57:27,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:57:27,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:57:27,260 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:57:27,260 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:57:27,261 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2019-11-19 22:57:27,312 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data/7948ab572/f10d3523d6b64f37b9bcd9be08b96639/FLAGd662b0d19 [2019-11-19 22:57:27,683 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:57:27,684 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2019-11-19 22:57:27,689 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data/7948ab572/f10d3523d6b64f37b9bcd9be08b96639/FLAGd662b0d19 [2019-11-19 22:57:28,055 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/data/7948ab572/f10d3523d6b64f37b9bcd9be08b96639 [2019-11-19 22:57:28,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:57:28,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:57:28,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:57:28,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:57:28,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:57:28,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1465c804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28, skipping insertion in model container [2019-11-19 22:57:28,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,076 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:57:28,092 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:57:28,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:57:28,306 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:57:28,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:57:28,339 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:57:28,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28 WrapperNode [2019-11-19 22:57:28,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:57:28,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:57:28,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:57:28,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:57:28,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:57:28,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:57:28,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:57:28,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:57:28,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... [2019-11-19 22:57:28,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:57:28,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:57:28,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:57:28,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:57:28,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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-19 22:57:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:57:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:57:30,318 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:57:30,319 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 22:57:30,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:57:30 BoogieIcfgContainer [2019-11-19 22:57:30,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:57:30,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:57:30,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:57:30,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:57:30,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:57:28" (1/3) ... [2019-11-19 22:57:30,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229d9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:57:30, skipping insertion in model container [2019-11-19 22:57:30,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:57:28" (2/3) ... [2019-11-19 22:57:30,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229d9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:57:30, skipping insertion in model container [2019-11-19 22:57:30,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:57:30" (3/3) ... [2019-11-19 22:57:30,327 INFO L109 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i [2019-11-19 22:57:30,336 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:57:30,342 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:57:30,352 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:57:30,374 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:57:30,374 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:57:30,374 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:57:30,374 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:57:30,375 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:57:30,375 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:57:30,375 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:57:30,375 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:57:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-11-19 22:57:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-19 22:57:30,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:57:30,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-19 22:57:30,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:57:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:57:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-11-19 22:57:30,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:57:30,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943734784] [2019-11-19 22:57:30,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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-19 22:57:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:57:30,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:57:30,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:57:33,903 WARN L191 SmtUtils]: Spent 3.13 s on a formula simplification that was a NOOP. DAG size: 11 [2019-11-19 22:57:33,910 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-19 22:57:33,910 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:57:36,194 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-19 22:57:36,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943734784] [2019-11-19 22:57:36,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:57:36,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-19 22:57:36,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774416849] [2019-11-19 22:57:36,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:57:36,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:57:36,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:57:36,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=5, Unknown=1, NotChecked=0, Total=12 [2019-11-19 22:57:36,213 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2019-11-19 22:57:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:57:43,217 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-19 22:57:43,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:57:43,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-19 22:57:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:57:43,226 INFO L225 Difference]: With dead ends: 19 [2019-11-19 22:57:43,226 INFO L226 Difference]: Without dead ends: 7 [2019-11-19 22:57:43,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6, Invalid=5, Unknown=1, NotChecked=0, Total=12 [2019-11-19 22:57:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-11-19 22:57:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-19 22:57:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:57:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-11-19 22:57:43,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-11-19 22:57:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:57:43,261 INFO L462 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-11-19 22:57:43,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:57:43,262 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-11-19 22:57:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-19 22:57:43,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:57:43,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:57:43,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 22:57:43,467 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:57:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:57:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash 925620370, now seen corresponding path program 1 times [2019-11-19 22:57:43,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:57:43,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355277822] [2019-11-19 22:57:43,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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-19 22:57:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:57:44,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:57:44,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:57:48,698 WARN L191 SmtUtils]: Spent 4.67 s on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 22:57:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:57:48,702 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:57:50,967 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0)) is different from false [2019-11-19 22:57:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-11-19 22:57:51,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355277822] [2019-11-19 22:57:51,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:57:51,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-11-19 22:57:51,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717561034] [2019-11-19 22:57:51,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:57:51,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:57:51,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:57:51,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2019-11-19 22:57:51,687 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-11-19 22:57:53,939 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)) (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-19 22:57:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:57:58,689 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-19 22:57:58,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:57:58,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-11-19 22:57:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:57:58,690 INFO L225 Difference]: With dead ends: 13 [2019-11-19 22:57:58,690 INFO L226 Difference]: Without dead ends: 9 [2019-11-19 22:57:58,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2019-11-19 22:57:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-11-19 22:57:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-19 22:57:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:57:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-11-19 22:57:58,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-11-19 22:57:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:57:58,694 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-11-19 22:57:58,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:57:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-11-19 22:57:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 22:57:58,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:57:58,695 INFO L410 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-11-19 22:57:58,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 22:57:58,902 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:57:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:57:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash 516237138, now seen corresponding path program 2 times [2019-11-19 22:57:58,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:57:58,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711861203] [2019-11-19 22:57:58,903 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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-19 22:57:59,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:57:59,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:57:59,940 WARN L253 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:57:59,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:58:08,011 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 14 [2019-11-19 22:58:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:58:08,016 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:58:18,732 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 (/ 8.0 5.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-19 22:58:21,186 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2019-11-19 22:58:23,649 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2019-11-19 22:58:26,356 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 22:58:29,063 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 22:58:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-11-19 22:58:29,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711861203] [2019-11-19 22:58:29,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:58:29,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-11-19 22:58:29,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088726412] [2019-11-19 22:58:29,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:58:29,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:58:29,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:58:29,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=52, Unknown=9, NotChecked=48, Total=132 [2019-11-19 22:58:29,067 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 12 states. [2019-11-19 22:58:31,804 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (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 .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse2) .cse2))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse2) .cse1)) (fp.eq .cse1 .cse0))) (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-19 22:58:34,292 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-19 22:58:36,553 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-19 22:58:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:58:45,224 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-19 22:58:45,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:58:45,234 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-11-19 22:58:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:58:45,235 INFO L225 Difference]: With dead ends: 17 [2019-11-19 22:58:45,235 INFO L226 Difference]: Without dead ends: 11 [2019-11-19 22:58:45,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=34, Invalid=68, Unknown=12, NotChecked=126, Total=240 [2019-11-19 22:58:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-11-19 22:58:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-19 22:58:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-19 22:58:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-11-19 22:58:45,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-11-19 22:58:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:58:45,247 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-11-19 22:58:45,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:58:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-11-19 22:58:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:58:45,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:58:45,248 INFO L410 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-11-19 22:58:45,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 22:58:45,471 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:58:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:58:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2059024878, now seen corresponding path program 3 times [2019-11-19 22:58:45,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:58:45,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025136992] [2019-11-19 22:58:45,472 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/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-19 22:58:47,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 22:58:47,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:58:47,435 WARN L253 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 22:58:47,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:59:01,570 WARN L191 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 16 [2019-11-19 22:59:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:59:01,575 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:59:09,937 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 (/ 8.0 5.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-19 22:59:14,133 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2019-11-19 22:59:16,648 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2019-11-19 22:59:19,453 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 22:59:22,247 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 22:59:25,212 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 22:59:28,203 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 22:59:31,517 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .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-19 22:59:34,779 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .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-19 22:59:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2019-11-19 22:59:34,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025136992] [2019-11-19 22:59:34,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:59:34,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2019-11-19 22:59:34,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019174566] [2019-11-19 22:59:34,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 22:59:34,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:59:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:59:34,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=85, Unknown=14, NotChecked=110, Total=240 [2019-11-19 22:59:34,784 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 16 states. [2019-11-19 22:59:38,036 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .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)) (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-19 22:59:41,032 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) .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-19 22:59:43,788 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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 (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-19 22:59:46,282 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) (= c_ULTIMATE.start_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2019-11-19 23:00:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:01,692 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-19 23:00:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:00:01,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-11-19 23:00:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:00:01,694 INFO L225 Difference]: With dead ends: 19 [2019-11-19 23:00:01,694 INFO L226 Difference]: Without dead ends: 13 [2019-11-19 23:00:01,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.1s TimeCoverageRelationStatistics Valid=44, Invalid=106, Unknown=18, NotChecked=252, Total=420 [2019-11-19 23:00:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-19 23:00:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-19 23:00:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-19 23:00:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-11-19 23:00:01,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-11-19 23:00:01,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:00:01,703 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-11-19 23:00:01,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 23:00:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-11-19 23:00:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 23:00:01,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:00:01,704 INFO L410 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-11-19 23:00:01,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 23:00:01,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:00:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1310307538, now seen corresponding path program 4 times [2019-11-19 23:00:01,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:00:01,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653174758] [2019-11-19 23:00:01,923 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-19 23:00:03,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:00:03,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:00:04,124 WARN L253 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 23:00:04,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:21,149 WARN L191 SmtUtils]: Spent 2.87 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-19 23:00:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:00:21,152 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:00:25,737 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0)) is different from false [2019-11-19 23:00:29,000 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 23:00:31,507 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 23:00:34,285 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-11-19 23:00:37,061 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-11-19 23:00:40,084 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-11-19 23:00:43,106 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-11-19 23:00:46,503 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-11-19 23:00:49,944 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-11-19 23:00:54,099 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-11-19 23:00:58,198 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-11-19 23:01:03,015 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-11-19 23:01:07,655 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-11-19 23:01:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2019-11-19 23:01:07,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653174758] [2019-11-19 23:01:07,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:01:07,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-19 23:01:07,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852449159] [2019-11-19 23:01:07,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 23:01:07,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:01:07,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 23:01:07,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=86, Unknown=18, NotChecked=168, Total=306 [2019-11-19 23:01:07,659 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 18 states. [2019-11-19 23:01:12,516 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-19 23:01:16,604 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) c_ULTIMATE.start_main_~x1~0) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2019-11-19 23:01:20,042 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2019-11-19 23:01:23,043 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_ULTIMATE.start_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2019-11-19 23:01:25,814 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-19 23:01:28,337 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-19 23:01:30,604 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-11-19 23:01:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:01:34,504 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-19 23:01:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:01:34,504 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 12 [2019-11-19 23:01:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:01:34,505 INFO L225 Difference]: With dead ends: 19 [2019-11-19 23:01:34,505 INFO L226 Difference]: Without dead ends: 15 [2019-11-19 23:01:34,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.4s TimeCoverageRelationStatistics Valid=48, Invalid=93, Unknown=25, NotChecked=434, Total=600 [2019-11-19 23:01:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-19 23:01:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-19 23:01:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 23:01:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-19 23:01:34,511 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-11-19 23:01:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:01:34,511 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-19 23:01:34,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 23:01:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-19 23:01:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 23:01:34,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:01:34,512 INFO L410 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-11-19 23:01:34,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 23:01:34,713 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:01:34,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:01:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash 833418130, now seen corresponding path program 5 times [2019-11-19 23:01:34,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:01:34,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938587425] [2019-11-19 23:01:34,715 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa3d900d-39a2-4e30-872b-7c3fdba5fb12/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-19 23:01:39,248 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-19 23:01:39,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:01:39,483 WARN L253 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 23:01:39,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:01:41,870 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 .cse0) c_ULTIMATE.start_main_~x1~0) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x~0))) is different from true [2019-11-19 23:01:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2019-11-19 23:01:41,873 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:01:44,152 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0)) is different from false [2019-11-19 23:01:47,357 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 23:01:49,831 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.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-19 23:01:52,636 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-11-19 23:01:55,399 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-11-19 23:01:58,420 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-11-19 23:02:01,442 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-11-19 23:02:04,843 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-11-19 23:02:07,078 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-19 23:02:07,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-19 23:02:07,280 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.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:851) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) 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) ... 42 more [2019-11-19 23:02:07,285 INFO L168 Benchmark]: Toolchain (without parser) took 279224.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 960.4 MB in the beginning and 958.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 154.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:02:07,285 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:02:07,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.76 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:02:07,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:02:07,287 INFO L168 Benchmark]: Boogie Preprocessor took 23.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 23:02:07,287 INFO L168 Benchmark]: RCFGBuilder took 1870.97 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:02:07,289 INFO L168 Benchmark]: TraceAbstraction took 276962.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.9 MB in the end (delta: 171.3 MB). Peak memory consumption was 171.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:02:07,293 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.76 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 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 85.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1870.97 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 276962.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.9 MB in the end (delta: 171.3 MB). Peak memory consumption was 171.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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...