./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c --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_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad ........................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:06:23,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 16:06:23,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 16:06:23,313 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 16:06:23,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 16:06:23,314 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 16:06:23,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 16:06:23,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 16:06:23,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 16:06:23,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 16:06:23,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 16:06:23,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 16:06:23,322 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 16:06:23,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 16:06:23,324 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 16:06:23,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 16:06:23,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 16:06:23,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 16:06:23,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 16:06:23,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 16:06:23,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 16:06:23,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 16:06:23,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 16:06:23,336 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 16:06:23,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 16:06:23,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 16:06:23,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 16:06:23,339 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 16:06:23,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 16:06:23,341 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 16:06:23,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 16:06:23,342 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 16:06:23,342 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 16:06:23,342 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 16:06:23,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 16:06:23,343 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 16:06:23,344 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 16:06:23,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 16:06:23,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 16:06:23,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 16:06:23,358 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 16:06:23,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 16:06:23,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 16:06:23,359 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 16:06:23,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 16:06:23,359 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 16:06:23,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 16:06:23,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 16:06:23,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 16:06:23,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 16:06:23,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 16:06:23,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 16:06:23,361 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 16:06:23,362 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 16:06:23,362 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 16:06:23,362 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 16:06:23,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 16:06:23,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 16:06:23,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 16:06:23,363 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 16:06:23,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 16:06:23,363 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 16:06:23,363 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 16:06:23,363 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 16:06:23,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 16:06:23,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 16:06:23,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 16:06:23,364 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_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 -> c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad [2018-11-23 16:06:23,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 16:06:23,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 16:06:23,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 16:06:23,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 16:06:23,412 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 16:06:23,412 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 16:06:23,469 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data/18e36ba0c/c23be871252b47a2941b4b922e70a4da/FLAG667d94722 [2018-11-23 16:06:23,838 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 16:06:23,838 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 16:06:23,843 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data/18e36ba0c/c23be871252b47a2941b4b922e70a4da/FLAG667d94722 [2018-11-23 16:06:23,859 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data/18e36ba0c/c23be871252b47a2941b4b922e70a4da [2018-11-23 16:06:23,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 16:06:23,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 16:06:23,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 16:06:23,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 16:06:23,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 16:06:23,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:06:23" (1/1) ... [2018-11-23 16:06:23,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bb9358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:23, skipping insertion in model container [2018-11-23 16:06:23,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:06:23" (1/1) ... [2018-11-23 16:06:23,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 16:06:23,902 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 16:06:24,074 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:06:24,079 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 16:06:24,091 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:06:24,103 INFO L195 MainTranslator]: Completed translation [2018-11-23 16:06:24,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24 WrapperNode [2018-11-23 16:06:24,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 16:06:24,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 16:06:24,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 16:06:24,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 16:06:24,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... [2018-11-23 16:06:24,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... [2018-11-23 16:06:24,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 16:06:24,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 16:06:24,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 16:06:24,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 16:06:24,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... [2018-11-23 16:06:24,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... [2018-11-23 16:06:24,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... [2018-11-23 16:06:24,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... [2018-11-23 16:06:24,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... [2018-11-23 16:06:24,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... [2018-11-23 16:06:24,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... [2018-11-23 16:06:24,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 16:06:24,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 16:06:24,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 16:06:24,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 16:06:24,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 16:06:24,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 16:06:24,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 16:06:24,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 16:06:24,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 16:06:24,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 16:06:24,221 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 16:06:24,332 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 16:06:24,332 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 16:06:24,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:06:24 BoogieIcfgContainer [2018-11-23 16:06:24,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 16:06:24,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 16:06:24,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 16:06:24,336 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 16:06:24,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:06:23" (1/3) ... [2018-11-23 16:06:24,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce6832e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:06:24, skipping insertion in model container [2018-11-23 16:06:24,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:24" (2/3) ... [2018-11-23 16:06:24,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce6832e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:06:24, skipping insertion in model container [2018-11-23 16:06:24,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:06:24" (3/3) ... [2018-11-23 16:06:24,339 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 16:06:24,346 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 16:06:24,351 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 16:06:24,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 16:06:24,384 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 16:06:24,385 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 16:06:24,385 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 16:06:24,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 16:06:24,385 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 16:06:24,386 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 16:06:24,386 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 16:06:24,386 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 16:06:24,386 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 16:06:24,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-23 16:06:24,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 16:06:24,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:06:24,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:06:24,407 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 16:06:24,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:06:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-23 16:06:24,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:06:24,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:06:24,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:06:24,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:06:24,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:06:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:06:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:06:24,512 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~__return_main~0)|=2, ~__return_main~0=2] [?] ~__return_main~0 := 0; VAL [|old(~__return_main~0)|=2, ~__return_main~0=0] [?] assume true; VAL [|old(~__return_main~0)|=2, ~__return_main~0=0] [?] RET #20#return; VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [?] ~main__x~0 := 1.0;~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.600000023841858); VAL [main_~main__x~0=1.0, ~__return_main~0=0] [?] assume !~someBinaryFLOATComparisonOperation(~main__x1~0, ~main__x~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~someBinaryFLOATComparisonOperation(~main__x~0, ~convertINTToFLOAT(0)) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [main_~__tmp_1~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main__x~0=1.0, ~__return_main~0=0] [?] assume 0 == ~__VERIFIER_assert__cond~0; VAL [main_~__tmp_1~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main__x~0=1.0, ~__return_main~0=0] [?] assume !false; VAL [main_~__tmp_1~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main__x~0=1.0, ~__return_main~0=0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] ensures true; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.600000023841858); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10-L33] assume !~someBinaryFLOATComparisonOperation(~main__x1~0, ~main__x~0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryFLOATComparisonOperation(~main__x~0, ~convertINTToFLOAT(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23-L31] assume 0 == ~__VERIFIER_assert__cond~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] ensures true; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.600000023841858); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10-L33] assume !~someBinaryFLOATComparisonOperation(~main__x1~0, ~main__x~0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryFLOATComparisonOperation(~main__x~0, ~convertINTToFLOAT(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23-L31] assume 0 == ~__VERIFIER_assert__cond~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.600000023841858); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryFLOATComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryFLOATComparisonOperation(~main__x~0, ~convertINTToFLOAT(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.600000023841858); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryFLOATComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryFLOATComparisonOperation(~main__x~0, ~convertINTToFLOAT(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.600000023841858); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryFLOATComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryFLOATComparisonOperation(~main__x~0, ~convertINTToFLOAT(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.600000023841858); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryFLOATComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryFLOATComparisonOperation(~main__x~0, ~convertINTToFLOAT(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] float main__x = 1.0; [L8] float main__x1 = main__x / 1.600000023841858; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] ----- [2018-11-23 16:06:24,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:06:24 BoogieIcfgContainer [2018-11-23 16:06:24,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 16:06:24,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 16:06:24,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 16:06:24,543 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 16:06:24,544 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:06:24" (3/4) ... [2018-11-23 16:06:24,547 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 16:06:24,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 16:06:24,548 INFO L168 Benchmark]: Toolchain (without parser) took 684.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 962.4 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 16:06:24,549 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 16:06:24,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.44 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 16:06:24,551 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.99 ms. Allocated memory is still 1.0 GB. Free memory is still 951.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 16:06:24,551 INFO L168 Benchmark]: Boogie Preprocessor took 14.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 16:06:24,552 INFO L168 Benchmark]: RCFGBuilder took 197.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 16:06:24,552 INFO L168 Benchmark]: TraceAbstraction took 209.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-11-23 16:06:24,553 INFO L168 Benchmark]: Witness Printer took 4.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 16:06:24,556 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 238.44 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.6 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.99 ms. Allocated memory is still 1.0 GB. Free memory is still 951.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 197.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 209.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 25]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 10, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] float main__x = 1.0; [L8] float main__x1 = main__x / 1.600000023841858; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 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=14occurred 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, 9 NumberOfCodeBlocks, 9 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 16:06:26,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 16:06:26,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 16:06:26,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 16:06:26,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 16:06:26,256 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 16:06:26,257 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 16:06:26,259 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 16:06:26,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 16:06:26,261 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 16:06:26,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 16:06:26,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 16:06:26,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 16:06:26,264 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 16:06:26,265 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 16:06:26,265 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 16:06:26,266 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 16:06:26,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 16:06:26,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 16:06:26,271 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 16:06:26,272 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 16:06:26,273 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 16:06:26,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 16:06:26,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 16:06:26,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 16:06:26,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 16:06:26,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 16:06:26,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 16:06:26,279 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 16:06:26,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 16:06:26,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 16:06:26,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 16:06:26,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 16:06:26,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 16:06:26,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 16:06:26,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 16:06:26,284 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 16:06:26,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 16:06:26,297 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 16:06:26,298 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 16:06:26,298 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 16:06:26,298 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 16:06:26,298 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 16:06:26,299 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 16:06:26,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 16:06:26,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 16:06:26,299 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 16:06:26,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 16:06:26,300 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 16:06:26,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 16:06:26,301 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 16:06:26,301 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 16:06:26,301 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 16:06:26,301 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 16:06:26,301 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 16:06:26,301 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 16:06:26,301 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 16:06:26,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 16:06:26,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 16:06:26,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 16:06:26,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 16:06:26,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 16:06:26,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 16:06:26,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 16:06:26,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 16:06:26,303 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 16:06:26,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 16:06:26,303 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 16:06:26,303 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 16:06:26,303 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_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 -> c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad [2018-11-23 16:06:26,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 16:06:26,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 16:06:26,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 16:06:26,352 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 16:06:26,353 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 16:06:26,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 16:06:26,401 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data/ea4bd3bb2/72074a22112f40eba9df6af00aa5fdca/FLAG061223953 [2018-11-23 16:06:26,754 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 16:06:26,754 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 16:06:26,759 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data/ea4bd3bb2/72074a22112f40eba9df6af00aa5fdca/FLAG061223953 [2018-11-23 16:06:26,771 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/data/ea4bd3bb2/72074a22112f40eba9df6af00aa5fdca [2018-11-23 16:06:26,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 16:06:26,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 16:06:26,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 16:06:26,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 16:06:26,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 16:06:26,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:26,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e730af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26, skipping insertion in model container [2018-11-23 16:06:26,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:26,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 16:06:26,807 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 16:06:26,953 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:06:26,959 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 16:06:26,971 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:06:26,983 INFO L195 MainTranslator]: Completed translation [2018-11-23 16:06:26,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26 WrapperNode [2018-11-23 16:06:26,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 16:06:26,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 16:06:26,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 16:06:26,985 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 16:06:26,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:26,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:27,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 16:06:27,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 16:06:27,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 16:06:27,003 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 16:06:27,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:27,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:27,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:27,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:27,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:27,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:27,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... [2018-11-23 16:06:27,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 16:06:27,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 16:06:27,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 16:06:27,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 16:06:27,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 16:06:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 16:06:27,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 16:06:27,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 16:06:27,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 16:06:27,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 16:06:27,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 16:06:29,468 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 16:06:29,468 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 16:06:29,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:06:29 BoogieIcfgContainer [2018-11-23 16:06:29,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 16:06:29,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 16:06:29,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 16:06:29,472 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 16:06:29,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:06:26" (1/3) ... [2018-11-23 16:06:29,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143cf299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:06:29, skipping insertion in model container [2018-11-23 16:06:29,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:26" (2/3) ... [2018-11-23 16:06:29,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143cf299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:06:29, skipping insertion in model container [2018-11-23 16:06:29,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:06:29" (3/3) ... [2018-11-23 16:06:29,475 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 16:06:29,483 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 16:06:29,488 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 16:06:29,500 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 16:06:29,525 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 16:06:29,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 16:06:29,526 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 16:06:29,526 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 16:06:29,526 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 16:06:29,526 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 16:06:29,527 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 16:06:29,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 16:06:29,527 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 16:06:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-23 16:06:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 16:06:29,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:06:29,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:06:29,554 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 16:06:29,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:06:29,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-23 16:06:29,562 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 16:06:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 16:06:29,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:06:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:06:29,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:06:36,207 WARN L180 SmtUtils]: Spent 5.45 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 16:06:36,217 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 16:06:36,217 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 16:06:36,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 16:06:36,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 16:06:36,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 16:06:36,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 16:06:36,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 16:06:36,248 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-11-23 16:06:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:06:40,048 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 16:06:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 16:06:40,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 16:06:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 16:06:40,301 INFO L225 Difference]: With dead ends: 22 [2018-11-23 16:06:40,301 INFO L226 Difference]: Without dead ends: 11 [2018-11-23 16:06:40,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 16:06:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-11-23 16:06:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 16:06:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 16:06:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 16:06:40,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-11-23 16:06:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 16:06:40,333 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-11-23 16:06:40,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 16:06:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 16:06:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 16:06:40,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:06:40,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:06:40,335 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 16:06:40,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:06:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-11-23 16:06:40,335 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 16:06:40,336 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 16:06:40,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:06:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:06:40,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:06:43,248 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-23 16:06:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 16:06:43,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 16:06:45,532 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-23 16:06:47,783 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-11-23 16:06:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 16:06:47,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 16:06:47,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 16:06:47,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 16:06:47,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 16:06:47,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=8, Unknown=3, NotChecked=10, Total=30 [2018-11-23 16:06:47,817 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-11-23 16:06:50,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_main_~main__x1~0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)))) is different from true [2018-11-23 16:07:03,928 WARN L180 SmtUtils]: Spent 10.85 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 16:07:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:07:06,527 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 16:07:06,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 16:07:06,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 16:07:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 16:07:06,528 INFO L225 Difference]: With dead ends: 15 [2018-11-23 16:07:06,528 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 16:07:06,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=14, Invalid=13, Unknown=5, NotChecked=24, Total=56 [2018-11-23 16:07:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 16:07:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 16:07:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 16:07:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 16:07:06,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 16:07:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 16:07:06,534 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 16:07:06,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 16:07:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 16:07:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 16:07:06,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:07:06,537 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:07:06,537 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 16:07:06,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:07:06,538 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2018-11-23 16:07:06,538 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 16:07:06,538 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 16:07:06,554 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 16:07:07,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 16:07:07,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 16:07:07,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:07:09,753 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))))) is different from true [2018-11-23 16:07:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 16:07:09,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 16:07:12,101 WARN L832 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0))) is different from false [2018-11-23 16:07:14,387 WARN L854 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0))) is different from true [2018-11-23 16:07:16,886 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 16:07:19,408 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 16:07:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-23 16:07:19,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 16:07:19,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-23 16:07:19,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 16:07:19,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 16:07:19,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=22, Unknown=5, NotChecked=30, Total=72 [2018-11-23 16:07:19,442 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-11-23 16:07:22,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1)) c_main_~main__x1~0) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) .cse1)) .cse2)) (fp.eq .cse2 .cse0))))) is different from true [2018-11-23 16:07:24,329 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-23 16:07:26,608 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))))) is different from true [2018-11-23 16:07:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:07:30,721 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 16:07:30,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 16:07:30,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-11-23 16:07:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 16:07:30,722 INFO L225 Difference]: With dead ends: 16 [2018-11-23 16:07:30,722 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 16:07:30,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=21, Invalid=25, Unknown=8, NotChecked=78, Total=132 [2018-11-23 16:07:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 16:07:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 16:07:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 16:07:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 16:07:30,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 16:07:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 16:07:30,729 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 16:07:30,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 16:07:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 16:07:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 16:07:30,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:07:30,730 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:07:30,730 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 16:07:30,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:07:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2018-11-23 16:07:30,731 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 16:07:30,731 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 16:07:30,736 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 16:07:32,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 16:07:32,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 16:07:32,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:07:34,504 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-23 16:07:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-23 16:07:34,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 16:08:04,437 WARN L180 SmtUtils]: Spent 10.18 s on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 16:08:06,941 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 16:08:09,443 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 16:08:12,140 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 16:08:14,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 16:08:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-23 16:08:14,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 16:08:14,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-23 16:08:14,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 16:08:14,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 16:08:14,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=12, NotChecked=42, Total=110 [2018-11-23 16:08:14,897 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-11-23 16:08:17,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1)) c_main_~main__x1~0) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) .cse1)) .cse2)) (fp.eq .cse2 .cse0))))) is different from true [2018-11-23 16:08:20,144 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1)) c_main_~main__x1~0) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) .cse1)) .cse2)) (fp.eq .cse2 .cse0))))) is different from true [2018-11-23 16:08:59,832 WARN L180 SmtUtils]: Spent 27.66 s on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-11-23 16:09:06,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (not (= c_main_~__VERIFIER_assert__cond~0 (_ bv0 32))) (or (fp.eq c_main_~main__x1~0 .cse0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0))))) is different from true [2018-11-23 16:09:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:09:14,907 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 16:09:14,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 16:09:14,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-11-23 16:09:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 16:09:14,908 INFO L225 Difference]: With dead ends: 19 [2018-11-23 16:09:14,908 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 16:09:14,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.1s TimeCoverageRelationStatistics Valid=32, Invalid=47, Unknown=17, NotChecked=114, Total=210 [2018-11-23 16:09:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 16:09:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 16:09:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 16:09:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 16:09:14,912 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 16:09:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 16:09:14,912 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 16:09:14,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 16:09:14,913 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 16:09:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 16:09:14,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:09:14,913 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:09:14,913 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 16:09:14,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:09:14,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 4 times [2018-11-23 16:09:14,914 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 16:09:14,914 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 16:09:14,917 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 16:09:16,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 16:09:16,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 16:09:16,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:09:32,441 WARN L180 SmtUtils]: Spent 4.99 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 16:09:32,444 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 16:09:32,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 16:09:36,961 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-23 16:09:40,897 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:09:43,338 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:09:46,021 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:09:48,749 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:09:51,641 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:09:54,497 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:09:57,620 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:10:00,756 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:10:00,778 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 16:10:00,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 16:10:00,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 16:10:00,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 16:10:00,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 16:10:00,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=53, Unknown=13, NotChecked=90, Total=182 [2018-11-23 16:10:00,802 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-11-23 16:10:03,978 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-11-23 16:10:06,923 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-11-23 16:10:09,606 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-23 16:10:12,081 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-23 16:10:14,327 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)))) is different from true [2018-11-23 16:10:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:10:27,104 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 16:10:27,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 16:10:27,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-11-23 16:10:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 16:10:27,105 INFO L225 Difference]: With dead ends: 19 [2018-11-23 16:10:27,105 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 16:10:27,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.5s TimeCoverageRelationStatistics Valid=36, Invalid=58, Unknown=18, NotChecked=230, Total=342 [2018-11-23 16:10:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 16:10:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 16:10:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 16:10:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 16:10:27,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 16:10:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 16:10:27,112 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 16:10:27,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 16:10:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 16:10:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 16:10:27,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:10:27,112 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:10:27,113 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 16:10:27,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:10:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 5 times [2018-11-23 16:10:27,113 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 16:10:27,113 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/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 16:10:27,116 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 16:10:29,313 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 16:10:29,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 16:10:29,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:10:31,790 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x~0) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-23 16:10:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-23 16:10:31,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 16:10:34,048 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-23 16:10:36,312 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-11-23 16:10:38,840 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:10:41,358 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:10:44,124 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:10:46,876 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:10:49,875 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:10:52,908 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:10:56,201 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:10:59,505 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:11:03,343 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:11:07,218 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:11:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2018-11-23 16:11:07,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 16:11:07,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 16:11:07,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 16:11:07,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 16:11:07,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=58, Unknown=13, NotChecked=140, Total=240 [2018-11-23 16:11:07,272 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-11-23 16:11:11,181 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-23 16:11:14,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-11-23 16:11:17,656 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-23 16:11:20,484 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-23 16:11:23,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-11-23 16:11:25,338 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)))) is different from true [2018-11-23 16:11:27,624 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x~0) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-23 16:11:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:11:29,587 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 16:11:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 16:11:29,588 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-11-23 16:11:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 16:11:29,588 INFO L225 Difference]: With dead ends: 20 [2018-11-23 16:11:29,589 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 16:11:29,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=43, Invalid=65, Unknown=20, NotChecked=378, Total=506 [2018-11-23 16:11:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 16:11:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 16:11:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 16:11:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 16:11:29,598 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-23 16:11:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 16:11:29,599 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 16:11:29,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 16:11:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 16:11:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 16:11:29,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:11:29,600 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:11:29,600 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 16:11:29,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:11:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 6 times [2018-11-23 16:11:29,601 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 16:11:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 16:11:29,606 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-23 16:11:32,306 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 16:11:32,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 16:11:32,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:11:55,723 WARN L180 SmtUtils]: Spent 6.92 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 16:11:55,729 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 16:11:55,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 16:12:04,691 WARN L854 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0))) is different from true [2018-11-23 16:12:07,237 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 16:12:09,786 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 16:12:12,634 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 16:12:15,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 16:12:18,569 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-11-23 16:12:21,668 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-11-23 16:12:25,065 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 16:12:28,447 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 16:12:32,386 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 16:12:35,790 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 16:12:39,197 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-11-23 16:12:42,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-11-23 16:12:42,613 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 16:12:42,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 16:12:42,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-11-23 16:12:42,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 16:12:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 16:12:42,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=103, Unknown=21, NotChecked=182, Total=342 [2018-11-23 16:12:42,647 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 19 states. [2018-11-23 16:12:46,111 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse2))) .cse2))) .cse2))) .cse2))) .cse2))) .cse2)))) (or (fp.eq .cse1 .cse0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse2)) .cse1)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse2)) c_main_~main__x1~0))) is different from true [2018-11-23 16:12:49,548 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-23 16:12:52,970 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-23 16:12:56,118 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-23 16:12:58,977 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-11-23 16:13:01,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-11-23 16:13:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:13:07,639 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 16:13:07,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 16:13:07,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2018-11-23 16:13:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 16:13:07,640 INFO L225 Difference]: With dead ends: 21 [2018-11-23 16:13:07,640 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 16:13:07,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.4s TimeCoverageRelationStatistics Valid=48, Invalid=109, Unknown=27, NotChecked=416, Total=600 [2018-11-23 16:13:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 16:13:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 16:13:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 16:13:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 16:13:07,650 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-23 16:13:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 16:13:07,650 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 16:13:07,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 16:13:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 16:13:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 16:13:07,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:13:07,651 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:13:07,651 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 16:13:07,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:13:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash 326947035, now seen corresponding path program 7 times [2018-11-23 16:13:07,652 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 16:13:07,652 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d351ddc-d0a7-47b3-aeaf-1ef4c3b28b6b/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 16:13:07,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 16:13:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:13:10,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:13:13,023 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-23 16:13:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-11-23 16:13:13,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 16:13:15,348 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-23 16:13:17,638 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-11-23 16:13:20,204 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:13:22,789 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:13:25,647 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:13:28,567 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:13:31,782 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:13:35,020 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:13:38,508 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:13:42,012 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:13:45,528 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:13:49,066 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:13:52,622 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:13:56,253 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:13:59,846 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-11-23 16:14:03,230 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-11-23 16:14:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2018-11-23 16:14:03,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 16:14:03,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 16:14:03,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 16:14:03,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 16:14:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=92, Unknown=17, NotChecked=234, Total=380 [2018-11-23 16:14:03,282 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 20 states. [2018-11-23 16:14:07,023 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-11-23 16:14:10,732 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-11-23 16:14:12,782 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 16:14:12,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 16:14:12,783 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:845) 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.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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) ... 43 more [2018-11-23 16:14:12,785 INFO L168 Benchmark]: Toolchain (without parser) took 466010.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 949.7 MB in the beginning and 845.8 MB in the end (delta: 103.9 MB). Peak memory consumption was 245.5 MB. Max. memory is 11.5 GB. [2018-11-23 16:14:12,786 INFO L168 Benchmark]: CDTParser took 0.20 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 16:14:12,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.16 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 16:14:12,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.39 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 16:14:12,787 INFO L168 Benchmark]: Boogie Preprocessor took 22.28 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 16:14:12,787 INFO L168 Benchmark]: RCFGBuilder took 2443.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-23 16:14:12,788 INFO L168 Benchmark]: TraceAbstraction took 463315.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 845.8 MB in the end (delta: 271.6 MB). Peak memory consumption was 271.6 MB. Max. memory is 11.5 GB. [2018-11-23 16:14:12,791 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.20 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 207.16 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 18.39 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 22.28 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 2443.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 463315.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 845.8 MB in the end (delta: 271.6 MB). Peak memory consumption was 271.6 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...