./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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.23-aa41828 [2018-11-23 09:51:24,212 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:51:24,214 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:51:24,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:51:24,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:51:24,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:51:24,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:51:24,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:51:24,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:51:24,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:51:24,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:51:24,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:51:24,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:51:24,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:51:24,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:51:24,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:51:24,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:51:24,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:51:24,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:51:24,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:51:24,238 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:51:24,239 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:51:24,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:51:24,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:51:24,241 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:51:24,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:51:24,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:51:24,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:51:24,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:51:24,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:51:24,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:51:24,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:51:24,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:51:24,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:51:24,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:51:24,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:51:24,246 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 09:51:24,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:51:24,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:51:24,258 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:51:24,258 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:51:24,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:51:24,259 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:51:24,259 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:51:24,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:51:24,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:51:24,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:51:24,259 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:51:24,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:51:24,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:51:24,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:51:24,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:51:24,260 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:51:24,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:51:24,260 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:51:24,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:51:24,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:51:24,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:51:24,261 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:51:24,261 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:51:24,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:51:24,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:51:24,262 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:51:24,262 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:51:24,262 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:51:24,262 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:51:24,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:51:24,262 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:51:24,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:51:24,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:51:24,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:51:24,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:51:24,303 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:51:24,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-11-23 09:51:24,350 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data/2e4645a33/a21075875b8348d29a68f36b245a4caa/FLAGf69d68bfa [2018-11-23 09:51:24,702 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:51:24,702 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-11-23 09:51:24,707 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data/2e4645a33/a21075875b8348d29a68f36b245a4caa/FLAGf69d68bfa [2018-11-23 09:51:25,115 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data/2e4645a33/a21075875b8348d29a68f36b245a4caa [2018-11-23 09:51:25,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:51:25,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:51:25,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:51:25,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:51:25,124 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:51:25,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee9d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25, skipping insertion in model container [2018-11-23 09:51:25,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:51:25,148 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:51:25,273 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:51:25,276 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:51:25,285 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:51:25,295 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:51:25,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25 WrapperNode [2018-11-23 09:51:25,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:51:25,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:51:25,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:51:25,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:51:25,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:51:25,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:51:25,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:51:25,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:51:25,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... [2018-11-23 09:51:25,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:51:25,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:51:25,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:51:25,338 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:51:25,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:51:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:51:25,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:51:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:51:25,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:51:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:51:25,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:51:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:51:25,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:51:25,541 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:51:25,541 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 09:51:25,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:51:25 BoogieIcfgContainer [2018-11-23 09:51:25,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:51:25,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:51:25,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:51:25,545 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:51:25,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:51:25" (1/3) ... [2018-11-23 09:51:25,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d5235e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:51:25, skipping insertion in model container [2018-11-23 09:51:25,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:25" (2/3) ... [2018-11-23 09:51:25,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d5235e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:51:25, skipping insertion in model container [2018-11-23 09:51:25,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:51:25" (3/3) ... [2018-11-23 09:51:25,548 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i [2018-11-23 09:51:25,555 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:51:25,560 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:51:25,571 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:51:25,593 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:51:25,594 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:51:25,594 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:51:25,594 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:51:25,594 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:51:25,594 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:51:25,594 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:51:25,594 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:51:25,595 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:51:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 09:51:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 09:51:25,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:51:25,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:51:25,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:51:25,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash -14991171, now seen corresponding path program 1 times [2018-11-23 09:51:25,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:25,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:25,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:25,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:25,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:25,705 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #32#return; [?] CALL call #t~ret0 := main(); [?] ~x~0 := 1.0;~x1~0 := ~someBinaryArithmeticDOUBLEoperation(~x~0, 1.6); VAL [main_~x~0=1.0] [?] assume !~someBinaryDOUBLEComparisonOperation(~x1~0, ~x~0); VAL [main_~x~0=1.0] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~x~0, ~convertINTToDOUBLE(0)) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L9] ~x~0 := 1.0; [L10] ~x1~0 := ~someBinaryArithmeticDOUBLEoperation(~x~0, 1.6); VAL [~x~0=1.0] [L12-L16] assume !~someBinaryDOUBLEComparisonOperation(~x1~0, ~x~0); VAL [~x~0=1.0] [L18] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~x~0, ~convertINTToDOUBLE(0)) then 1 else 0)); VAL [#in~cond=0] [L2] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L2] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L2] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L9] ~x~0 := 1.0; [L10] ~x1~0 := ~someBinaryArithmeticDOUBLEoperation(~x~0, 1.6); VAL [~x~0=1.0] [L12-L16] assume !~someBinaryDOUBLEComparisonOperation(~x1~0, ~x~0); VAL [~x~0=1.0] [L18] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~x~0, ~convertINTToDOUBLE(0)) then 1 else 0)); VAL [#in~cond=0] [L2] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L2] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L2] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L9] ~x~0 := 1.0; [L10] ~x1~0 := ~someBinaryArithmeticDOUBLEoperation(~x~0, 1.6); VAL [~x~0=1.0] [L12-L16] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x1~0, ~x~0) VAL [~x~0=1.0] [L18] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~x~0, ~convertINTToDOUBLE(0)) then 1 else 0)); VAL [#in~cond=0] [L2] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L2] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L2] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L9] ~x~0 := 1.0; [L10] ~x1~0 := ~someBinaryArithmeticDOUBLEoperation(~x~0, 1.6); VAL [~x~0=1.0] [L12-L16] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x1~0, ~x~0) VAL [~x~0=1.0] [L18] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~x~0, ~convertINTToDOUBLE(0)) then 1 else 0)); VAL [#in~cond=0] [L2] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L2] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L2] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L9] ~x~0 := 1.0; [L10] ~x1~0 := ~someBinaryArithmeticDOUBLEoperation(~x~0, 1.6); VAL [~x~0=1.0] [L12-L16] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x1~0, ~x~0) VAL [~x~0=1.0] [L18] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~x~0, ~convertINTToDOUBLE(0)) then 1 else 0)); VAL [#in~cond=0] [L2] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L2] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L2] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L9] ~x~0 := 1.0; [L10] ~x1~0 := ~someBinaryArithmeticDOUBLEoperation(~x~0, 1.6); VAL [~x~0=1.0] [L12-L16] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x1~0, ~x~0) VAL [~x~0=1.0] [L18] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~x~0, ~convertINTToDOUBLE(0)) then 1 else 0)); VAL [#in~cond=0] [L2] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L2] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L2] assert false; VAL [#in~cond=0, ~cond=0] [L9] double x = 1.0; [L10] double x1 = x/1.6; VAL [x=1] [L12] COND FALSE !(x1 != x) VAL [x=1] [L18] CALL __VERIFIER_assert(x == 0) VAL [\old(cond)=0] [L2] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L2] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 09:51:25,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:51:25 BoogieIcfgContainer [2018-11-23 09:51:25,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:51:25,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:51:25,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:51:25,727 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:51:25,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:51:25" (3/4) ... [2018-11-23 09:51:25,730 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 09:51:25,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:51:25,731 INFO L168 Benchmark]: Toolchain (without parser) took 612.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -97.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:51:25,732 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:51:25,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.68 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:51:25,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.94 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:51:25,734 INFO L168 Benchmark]: Boogie Preprocessor took 20.73 ms. Allocated memory is still 1.0 GB. Free memory is still 939.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:51:25,734 INFO L168 Benchmark]: RCFGBuilder took 203.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:51:25,735 INFO L168 Benchmark]: TraceAbstraction took 184.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:51:25,735 INFO L168 Benchmark]: Witness Printer took 3.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:51:25,738 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.68 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 20.94 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.73 ms. Allocated memory is still 1.0 GB. Free memory is still 939.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 203.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 184.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. 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 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L9] double x = 1.0; [L10] double x1 = x/1.6; VAL [x=1] [L12] COND FALSE !(x1 != x) VAL [x=1] [L18] CALL __VERIFIER_assert(x == 0) VAL [\old(cond)=0] [L2] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L2] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-aa41828 [2018-11-23 09:51:27,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:51:27,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:51:27,414 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:51:27,414 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:51:27,415 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:51:27,416 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:51:27,417 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:51:27,418 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:51:27,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:51:27,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:51:27,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:51:27,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:51:27,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:51:27,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:51:27,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:51:27,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:51:27,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:51:27,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:51:27,429 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:51:27,430 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:51:27,431 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:51:27,433 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:51:27,433 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:51:27,434 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:51:27,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:51:27,435 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:51:27,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:51:27,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:51:27,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:51:27,437 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:51:27,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:51:27,438 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:51:27,438 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:51:27,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:51:27,440 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:51:27,440 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:51:27,453 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:51:27,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:51:27,454 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:51:27,454 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:51:27,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:51:27,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:51:27,455 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:51:27,455 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:51:27,456 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:51:27,456 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:51:27,456 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:51:27,456 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:51:27,456 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:51:27,456 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:51:27,456 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:51:27,457 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:51:27,457 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:51:27,457 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:51:27,457 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:51:27,457 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:51:27,457 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:51:27,457 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:51:27,458 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:51:27,458 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:51:27,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:51:27,458 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:51:27,458 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:51:27,458 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:51:27,459 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:51:27,459 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:51:27,459 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:51:27,459 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:51:27,459 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:51:27,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:51:27,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:51:27,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:51:27,502 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:51:27,502 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:51:27,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-11-23 09:51:27,544 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data/f366b1c47/49d1fbbb513d4ca5a30ceb18eca6ef5d/FLAG01658247b [2018-11-23 09:51:27,887 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:51:27,888 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-11-23 09:51:27,892 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data/f366b1c47/49d1fbbb513d4ca5a30ceb18eca6ef5d/FLAG01658247b [2018-11-23 09:51:28,315 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/uautomizer/data/f366b1c47/49d1fbbb513d4ca5a30ceb18eca6ef5d [2018-11-23 09:51:28,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:51:28,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:51:28,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:51:28,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:51:28,323 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:51:28,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396f9cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28, skipping insertion in model container [2018-11-23 09:51:28,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:51:28,350 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:51:28,502 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:51:28,507 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:51:28,517 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:51:28,528 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:51:28,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28 WrapperNode [2018-11-23 09:51:28,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:51:28,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:51:28,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:51:28,529 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:51:28,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:51:28,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:51:28,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:51:28,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:51:28,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... [2018-11-23 09:51:28,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:51:28,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:51:28,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:51:28,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:51:28,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:51:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:51:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:51:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:51:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:51:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:51:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:51:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:51:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:51:29,642 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:51:29,642 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 09:51:29,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:51:29 BoogieIcfgContainer [2018-11-23 09:51:29,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:51:29,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:51:29,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:51:29,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:51:29,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:51:28" (1/3) ... [2018-11-23 09:51:29,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1577b8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:51:29, skipping insertion in model container [2018-11-23 09:51:29,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:28" (2/3) ... [2018-11-23 09:51:29,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1577b8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:51:29, skipping insertion in model container [2018-11-23 09:51:29,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:51:29" (3/3) ... [2018-11-23 09:51:29,649 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i [2018-11-23 09:51:29,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:51:29,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:51:29,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:51:29,694 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:51:29,694 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:51:29,694 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:51:29,694 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:51:29,695 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:51:29,695 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:51:29,695 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:51:29,695 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:51:29,695 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:51:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 09:51:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 09:51:29,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:51:29,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:51:29,717 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:51:29,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:29,721 INFO L82 PathProgramCache]: Analyzing trace with hash -14991171, now seen corresponding path program 1 times [2018-11-23 09:51:29,724 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:51:29,724 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:51:29,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:30,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:31,799 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 09:51:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:51:31,810 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:51:31,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:51:31,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:51:31,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:51:31,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:51:31,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:51:31,845 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-11-23 09:51:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:51:33,598 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 09:51:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:51:34,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 09:51:34,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:51:34,352 INFO L225 Difference]: With dead ends: 31 [2018-11-23 09:51:34,353 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 09:51:34,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:51:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 09:51:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 09:51:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:51:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 09:51:34,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 09:51:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:51:34,384 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 09:51:34,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:51:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 09:51:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 09:51:34,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:51:34,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:51:34,386 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:51:34,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:34,386 INFO L82 PathProgramCache]: Analyzing trace with hash -429188558, now seen corresponding path program 1 times [2018-11-23 09:51:34,386 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:51:34,386 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:51:34,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:34,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:40,018 WARN L180 SmtUtils]: Spent 3.39 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 09:51:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:51:40,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:51:53,245 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification that was a NOOP. DAG size: 7 [2018-11-23 09:51:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:51:53,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:51:53,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:51:53,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:51:53,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:51:53,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=15, Unknown=3, NotChecked=0, Total=30 [2018-11-23 09:51:53,280 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 09:52:04,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:52:04,415 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 09:52:04,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:52:04,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 09:52:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:52:04,660 INFO L225 Difference]: With dead ends: 19 [2018-11-23 09:52:04,660 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 09:52:04,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=17, Invalid=21, Unknown=4, NotChecked=0, Total=42 [2018-11-23 09:52:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 09:52:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 09:52:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 09:52:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 09:52:04,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-23 09:52:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:52:04,665 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 09:52:04,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:52:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 09:52:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 09:52:04,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:52:04,666 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:52:04,666 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:52:04,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:52:04,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1003863954, now seen corresponding path program 2 times [2018-11-23 09:52:04,667 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:52:04,667 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:52:04,672 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:52:05,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:52:05,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:52:05,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:52:14,886 WARN L180 SmtUtils]: Spent 3.36 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 09:52:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:52:14,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:52:24,558 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-11-23 09:52:26,805 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from true [2018-11-23 09:52:29,301 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 09:52:31,785 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 09:52:34,499 WARN L832 $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_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 [2018-11-23 09:52:37,227 WARN L854 $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_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 [2018-11-23 09:52:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-23 09:52:37,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:52:37,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-11-23 09:52:37,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 09:52:37,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 09:52:37,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=69, Unknown=8, NotChecked=54, Total=156 [2018-11-23 09:52:37,262 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-11-23 09:52:40,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 .cse2))) (or (fp.eq c_main_~x~0 .cse2) (not (fp.eq c_main_~x1~0 c_main_~x~0))))) is different from true [2018-11-23 09:52:42,508 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-11-23 09:52:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:52:56,937 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 09:52:56,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 09:52:56,937 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 09:52:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:52:56,938 INFO L225 Difference]: With dead ends: 24 [2018-11-23 09:52:56,938 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 09:52:56,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=33, Invalid=87, Unknown=10, NotChecked=110, Total=240 [2018-11-23 09:52:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 09:52:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 09:52:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 09:52:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 09:52:56,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-23 09:52:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:52:56,943 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 09:52:56,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 09:52:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 09:52:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 09:52:56,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:52:56,944 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:52:56,944 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:52:56,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:52:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash -517174030, now seen corresponding path program 3 times [2018-11-23 09:52:56,945 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:52:56,945 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:52:56,955 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:52:58,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 09:52:58,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:52:58,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:05,472 WARN L180 SmtUtils]: Spent 4.62 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 09:53:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:53:05,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:53:07,850 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-11-23 09:53:10,098 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from true [2018-11-23 09:53:12,602 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 09:53:15,102 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 09:53:17,843 WARN L832 $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_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 [2018-11-23 09:53:20,583 WARN L854 $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_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 [2018-11-23 09:53:23,514 WARN L832 $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_main_~x1~0 .cse1) .cse1) .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 [2018-11-23 09:53:26,466 WARN L854 $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_main_~x1~0 .cse1) .cse1) .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 [2018-11-23 09:53:29,646 WARN L832 $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_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 [2018-11-23 09:53:32,815 WARN L854 $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_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 [2018-11-23 09:53:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-11-23 09:53:32,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:53:32,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-11-23 09:53:32,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 09:53:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 09:53:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=109, Unknown=10, NotChecked=120, Total=272 [2018-11-23 09:53:32,858 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-11-23 09:53:36,058 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0) .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 .cse2))) (or (fp.eq c_main_~x~0 .cse2) (not (fp.eq c_main_~x1~0 c_main_~x~0))))) is different from true [2018-11-23 09:53:39,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0))) (or (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)))))) is different from true [2018-11-23 09:53:41,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_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 [2018-11-23 09:53:44,317 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-11-23 09:53:46,581 WARN L854 $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_main_~x1~0 .cse0) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= c_main_~x1~0 (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)))) is different from true [2018-11-23 09:53:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:53:55,095 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 09:53:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:53:55,095 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-11-23 09:53:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:53:55,096 INFO L225 Difference]: With dead ends: 26 [2018-11-23 09:53:55,096 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 09:53:55,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=47, Invalid=134, Unknown=15, NotChecked=310, Total=506 [2018-11-23 09:53:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 09:53:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 09:53:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 09:53:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 09:53:55,102 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-23 09:53:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:53:55,102 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 09:53:55,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 09:53:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 09:53:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:53:55,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:53:55,103 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:53:55,104 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:53:55,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:55,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1945796014, now seen corresponding path program 4 times [2018-11-23 09:53:55,104 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:53:55,104 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:53:55,107 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:53:57,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:53:57,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:53:57,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:14,710 WARN L180 SmtUtils]: Spent 3.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 09:54:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:54:14,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:54:18,757 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) is different from false [2018-11-23 09:54:21,011 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) is different from true [2018-11-23 09:54:23,519 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:54:26,028 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:54:28,782 WARN L832 $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_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:54:34,237 WARN L832 $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_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:54:37,244 WARN L854 $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_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:54:40,509 WARN L832 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:54:43,748 WARN L854 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:54:47,224 WARN L832 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:54:50,777 WARN L854 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:54:54,813 WARN L832 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:54:58,708 WARN L854 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:54:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2018-11-23 09:54:58,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:54:58,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 09:54:58,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 09:54:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 09:54:58,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=87, Unknown=17, NotChecked=168, Total=306 [2018-11-23 09:54:58,765 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-11-23 09:55:02,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))) (not (fp.eq c_main_~x1~0 c_main_~x~0)))) is different from true [2018-11-23 09:55:06,138 WARN L854 $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 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1)))) is different from true [2018-11-23 09:55:09,437 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2018-11-23 09:55:12,471 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2018-11-23 09:55:15,232 WARN L854 $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_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~x1~0 (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)))) is different from true [2018-11-23 09:55:17,740 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~x1~0 (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)))) is different from true [2018-11-23 09:55:20,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) c_main_~x1~0)) (= c_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)))) is different from true [2018-11-23 09:55:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:25,217 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 09:55:25,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 09:55:25,473 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-11-23 09:55:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:25,475 INFO L225 Difference]: With dead ends: 25 [2018-11-23 09:55:25,475 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 09:55:25,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.6s TimeCoverageRelationStatistics Valid=48, Invalid=94, Unknown=24, NotChecked=434, Total=600 [2018-11-23 09:55:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 09:55:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 09:55:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 09:55:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 09:55:25,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-23 09:55:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:25,482 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 09:55:25,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 09:55:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 09:55:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 09:55:25,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:25,483 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:25,483 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:25,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash -461987918, now seen corresponding path program 5 times [2018-11-23 09:55:25,484 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:55:25,484 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640266b2-151d-4d43-af8e-ebbb2ce01f35/bin-2019/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 [2018-11-23 09:55:25,491 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 09:55:29,754 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 09:55:29,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:29,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:32,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven c_main_~x~0 .cse0)) (= (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_main_~x~0))) is different from true [2018-11-23 09:55:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2018-11-23 09:55:32,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:34,631 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) is different from false [2018-11-23 09:55:37,582 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:55:39,998 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:55:42,671 WARN L832 $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_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:55:45,299 WARN L854 $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_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:55:48,154 WARN L832 $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_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:55:51,015 WARN L854 $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_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:55:54,091 WARN L832 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:55:57,150 WARN L854 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:56:00,416 WARN L832 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 09:56:03,713 WARN L854 $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_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 09:56:05,450 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 09:56:05,651 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2018-11-23 09:56:05,651 FATAL L265 ToolchainWalker]: 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:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-23 09:56:05,653 INFO L168 Benchmark]: Toolchain (without parser) took 277335.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.7 MB in the beginning and 920.7 MB in the end (delta: 29.0 MB). Peak memory consumption was 163.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:56:05,654 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:56:05,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.98 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:56:05,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.82 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 09:56:05,655 INFO L168 Benchmark]: Boogie Preprocessor took 20.65 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:56:05,655 INFO L168 Benchmark]: RCFGBuilder took 1076.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:56:05,656 INFO L168 Benchmark]: TraceAbstraction took 276009.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.7 MB in the end (delta: 190.7 MB). Peak memory consumption was 190.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:56:05,659 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 208.98 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 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 15.82 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.65 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1076.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 276009.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.7 MB in the end (delta: 190.7 MB). Peak memory consumption was 190.7 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...