./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-5842f4b [2018-11-18 08:35:12,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:35:12,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:35:12,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:35:12,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:35:12,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:35:12,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:35:12,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:35:12,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:35:12,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:35:12,022 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:35:12,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:35:12,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:35:12,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:35:12,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:35:12,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:35:12,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:35:12,026 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:35:12,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:35:12,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:35:12,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:35:12,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:35:12,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:35:12,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:35:12,032 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:35:12,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:35:12,033 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:35:12,034 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:35:12,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:35:12,035 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:35:12,035 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:35:12,036 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:35:12,036 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:35:12,036 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:35:12,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:35:12,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:35:12,037 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 08:35:12,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:35:12,048 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:35:12,048 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:35:12,048 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 08:35:12,049 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:35:12,049 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:35:12,049 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:35:12,049 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:35:12,049 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:35:12,049 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:35:12,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:35:12,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:35:12,050 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:35:12,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:35:12,050 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:35:12,050 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:35:12,050 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:35:12,051 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:35:12,051 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:35:12,051 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:35:12,051 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:35:12,051 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:35:12,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:35:12,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:35:12,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:35:12,052 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:35:12,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:35:12,052 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:35:12,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:35:12,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 08:35:12,052 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_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:35:12,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:35:12,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:35:12,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:35:12,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:35:12,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:35:12,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-18 08:35:12,126 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data/de743e03f/354ea03fcdaa427ba89a22b11bec466f/FLAGd1fc520aa [2018-11-18 08:35:12,441 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:35:12,442 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-18 08:35:12,446 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data/de743e03f/354ea03fcdaa427ba89a22b11bec466f/FLAGd1fc520aa [2018-11-18 08:35:12,456 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data/de743e03f/354ea03fcdaa427ba89a22b11bec466f [2018-11-18 08:35:12,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:35:12,460 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 08:35:12,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:12,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:35:12,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:35:12,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:12" (1/1) ... [2018-11-18 08:35:12,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78bb2e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12, skipping insertion in model container [2018-11-18 08:35:12,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:12" (1/1) ... [2018-11-18 08:35:12,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:35:12,487 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:35:12,609 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:12,612 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:35:12,620 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:12,628 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:35:12,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12 WrapperNode [2018-11-18 08:35:12,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:12,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:35:12,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:35:12,629 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:35:12,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2018-11-18 08:35:12,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2018-11-18 08:35:12,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2018-11-18 08:35:12,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2018-11-18 08:35:12,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2018-11-18 08:35:12,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2018-11-18 08:35:12,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2018-11-18 08:35:12,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:35:12,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:35:12,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:35:12,645 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:35:12,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:35:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:35:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:35:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:35:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 08:35:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 08:35:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:35:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:35:12,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:35:12,799 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:35:12,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:12 BoogieIcfgContainer [2018-11-18 08:35:12,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:35:12,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:35:12,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:35:12,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:35:12,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:35:12" (1/3) ... [2018-11-18 08:35:12,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84f11c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:12, skipping insertion in model container [2018-11-18 08:35:12,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (2/3) ... [2018-11-18 08:35:12,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84f11c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:12, skipping insertion in model container [2018-11-18 08:35:12,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:12" (3/3) ... [2018-11-18 08:35:12,805 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-18 08:35:12,811 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:35:12,815 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 08:35:12,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 08:35:12,841 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:35:12,841 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:35:12,841 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 08:35:12,841 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:35:12,842 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:35:12,842 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:35:12,842 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:35:12,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:35:12,842 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:35:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-18 08:35:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 08:35:12,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:12,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:12,858 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:12,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-18 08:35:12,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:12,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:12,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:12,930 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 08:35:12,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:35:12 BoogieIcfgContainer [2018-11-18 08:35:12,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 08:35:12,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:35:12,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:35:12,945 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:35:12,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:12" (3/4) ... [2018-11-18 08:35:12,948 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:35:12,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:35:12,948 INFO L168 Benchmark]: Toolchain (without parser) took 489.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 958.0 MB in the beginning and 1.1 GB in the end (delta: -113.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:12,949 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:12,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.29 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:12,950 INFO L168 Benchmark]: Boogie Preprocessor took 16.12 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:12,951 INFO L168 Benchmark]: RCFGBuilder took 154.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:12,951 INFO L168 Benchmark]: TraceAbstraction took 144.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:12,951 INFO L168 Benchmark]: Witness Printer took 3.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:12,953 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.29 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.12 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 154.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 144.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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-5842f4b [2018-11-18 08:35:14,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:35:14,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:35:14,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:35:14,426 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:35:14,427 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:35:14,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:35:14,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:35:14,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:35:14,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:35:14,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:35:14,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:35:14,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:35:14,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:35:14,433 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:35:14,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:35:14,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:35:14,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:35:14,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:35:14,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:35:14,439 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:35:14,439 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:35:14,441 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:35:14,441 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:35:14,441 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:35:14,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:35:14,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:35:14,443 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:35:14,444 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:35:14,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:35:14,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:35:14,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:35:14,446 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:35:14,446 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:35:14,447 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:35:14,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:35:14,447 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 08:35:14,458 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:35:14,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:35:14,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:35:14,459 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 08:35:14,460 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:35:14,460 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:35:14,460 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:35:14,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:35:14,460 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:35:14,460 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:35:14,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:35:14,461 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:35:14,461 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:35:14,461 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:35:14,461 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 08:35:14,461 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 08:35:14,461 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:35:14,461 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:35:14,461 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:35:14,461 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:35:14,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:35:14,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:35:14,462 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:35:14,462 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:35:14,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:35:14,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:35:14,462 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:35:14,462 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:35:14,462 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 08:35:14,462 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:35:14,463 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 08:35:14,463 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 08:35:14,463 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_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:35:14,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:35:14,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:35:14,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:35:14,503 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:35:14,504 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:35:14,504 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-18 08:35:14,541 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data/c945095e5/9c01c2d0d5ae4e14b48733e5d9738534/FLAGf71a07629 [2018-11-18 08:35:14,860 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:35:14,860 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-18 08:35:14,863 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data/c945095e5/9c01c2d0d5ae4e14b48733e5d9738534/FLAGf71a07629 [2018-11-18 08:35:15,300 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/bin-2019/uautomizer/data/c945095e5/9c01c2d0d5ae4e14b48733e5d9738534 [2018-11-18 08:35:15,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:35:15,303 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 08:35:15,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:15,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:35:15,306 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:35:15,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:15" (1/1) ... [2018-11-18 08:35:15,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78febe02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15, skipping insertion in model container [2018-11-18 08:35:15,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:15" (1/1) ... [2018-11-18 08:35:15,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:35:15,325 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:35:15,437 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:15,443 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:35:15,453 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:15,463 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:35:15,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15 WrapperNode [2018-11-18 08:35:15,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:15,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:35:15,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:35:15,464 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:35:15,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15" (1/1) ... [2018-11-18 08:35:15,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15" (1/1) ... [2018-11-18 08:35:15,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15" (1/1) ... [2018-11-18 08:35:15,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15" (1/1) ... [2018-11-18 08:35:15,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15" (1/1) ... [2018-11-18 08:35:15,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15" (1/1) ... [2018-11-18 08:35:15,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15" (1/1) ... [2018-11-18 08:35:15,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:35:15,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:35:15,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:35:15,486 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:35:15,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:35:15,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:35:15,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:35:15,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:35:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 08:35:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 08:35:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:35:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:35:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:35:17,827 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:35:17,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:17 BoogieIcfgContainer [2018-11-18 08:35:17,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:35:17,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:35:17,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:35:17,830 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:35:17,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:35:15" (1/3) ... [2018-11-18 08:35:17,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34764a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:17, skipping insertion in model container [2018-11-18 08:35:17,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:15" (2/3) ... [2018-11-18 08:35:17,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34764a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:17, skipping insertion in model container [2018-11-18 08:35:17,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:17" (3/3) ... [2018-11-18 08:35:17,836 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-18 08:35:17,842 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:35:17,846 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 08:35:17,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 08:35:17,871 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:35:17,872 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:35:17,872 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 08:35:17,872 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:35:17,872 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:35:17,873 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:35:17,873 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:35:17,873 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:35:17,873 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:35:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-18 08:35:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 08:35:17,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:17,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:17,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:17,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-18 08:35:17,901 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 08:35:17,902 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:35:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:18,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:20,370 WARN L854 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) is different from true [2018-11-18 08:35:20,378 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-18 08:35:20,378 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:35:20,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:20,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:20,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:20,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-18 08:35:20,401 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-11-18 08:35:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:20,413 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 08:35:20,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:20,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-18 08:35:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:20,422 INFO L225 Difference]: With dead ends: 22 [2018-11-18 08:35:20,422 INFO L226 Difference]: Without dead ends: 11 [2018-11-18 08:35:20,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-18 08:35:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-11-18 08:35:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 08:35:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 08:35:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-18 08:35:20,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-11-18 08:35:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:20,450 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-11-18 08:35:20,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-18 08:35:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 08:35:20,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:20,451 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:20,451 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:20,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-11-18 08:35:20,452 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 08:35:20,452 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:35:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:20,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:23,159 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-18 08:35:23,162 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-18 08:35:23,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:35:25,366 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-18 08:35:27,559 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-18 08:35:27,571 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-18 08:35:27,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:27,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 08:35:27,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:35:27,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:35:27,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=8, Unknown=3, NotChecked=10, Total=30 [2018-11-18 08:35:27,585 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-11-18 08:35:29,798 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-18 08:35:32,013 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))) (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))) is different from true [2018-11-18 08:35:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:34,494 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-18 08:35:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:35:34,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-18 08:35:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:34,496 INFO L225 Difference]: With dead ends: 15 [2018-11-18 08:35:34,496 INFO L226 Difference]: Without dead ends: 12 [2018-11-18 08:35:34,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13, Invalid=10, Unknown=5, NotChecked=28, Total=56 [2018-11-18 08:35:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-18 08:35:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 08:35:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 08:35:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-18 08:35:34,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-18 08:35:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:34,500 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-18 08:35:34,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:35:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 08:35:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 08:35:34,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:34,500 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:34,501 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:34,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2018-11-18 08:35:34,501 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 08:35:34,501 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:35:34,504 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 08:35:35,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:35:35,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:35:35,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:37,440 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-18 08:35:37,455 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-18 08:35:37,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:35:39,706 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-18 08:35:41,926 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-18 08:35:44,321 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-18 08:35:46,713 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-18 08:35:46,727 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-18 08:35:46,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:46,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-18 08:35:46,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 08:35:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:35:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=22, Unknown=5, NotChecked=30, Total=72 [2018-11-18 08:35:46,744 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-11-18 08:35:49,189 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-18 08:35:51,407 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-18 08:35:53,625 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-18 08:35:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:54,997 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-18 08:35:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:35:54,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-11-18 08:35:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:54,998 INFO L225 Difference]: With dead ends: 16 [2018-11-18 08:35:54,998 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 08:35:54,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=21, Invalid=25, Unknown=8, NotChecked=78, Total=132 [2018-11-18 08:35:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 08:35:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 08:35:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 08:35:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 08:35:55,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-18 08:35:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:55,001 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-18 08:35:55,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 08:35:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 08:35:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 08:35:55,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:55,002 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:55,002 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:55,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:55,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2018-11-18 08:35:55,003 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 08:35:55,003 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:35:55,006 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 08:35:56,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 08:35:56,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:35:56,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:36:09,223 WARN L180 SmtUtils]: Spent 6.70 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 08:36:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:09,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:36:15,488 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-18 08:36:17,703 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-18 08:36:20,122 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-18 08:36:22,547 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-18 08:36:25,172 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-18 08:36:27,811 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-18 08:36:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-18 08:36:27,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:36:27,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-18 08:36:27,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 08:36:27,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 08:36:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=40, Unknown=8, NotChecked=42, Total=110 [2018-11-18 08:36:27,840 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-11-18 08:36:30,497 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-18 08:36:32,955 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) (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-18 08:36:35,178 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 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-18 08:36:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:48,925 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-18 08:36:48,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:36:48,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-11-18 08:36:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:48,926 INFO L225 Difference]: With dead ends: 17 [2018-11-18 08:36:48,926 INFO L226 Difference]: Without dead ends: 14 [2018-11-18 08:36:48,926 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=26, Invalid=43, Unknown=11, NotChecked=102, Total=182 [2018-11-18 08:36:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-18 08:36:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 08:36:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 08:36:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-18 08:36:48,929 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-18 08:36:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:48,930 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-18 08:36:48,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 08:36:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 08:36:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 08:36:48,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:48,930 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:48,930 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:36:48,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 4 times [2018-11-18 08:36:48,931 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 08:36:48,931 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:36:48,934 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 08:36:50,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 08:36:50,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:36:50,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:03,852 WARN L180 SmtUtils]: Spent 4.63 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 08:37:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:03,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:37:06,789 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-18 08:37:09,975 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-18 08:37:12,412 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-18 08:37:15,084 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-18 08:37:17,758 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-18 08:37:20,611 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-18 08:37:23,471 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-18 08:37:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-11-18 08:37:23,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:23,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 08:37:23,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 08:37:23,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 08:37:23,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=41, Unknown=9, NotChecked=60, Total=132 [2018-11-18 08:37:23,507 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-11-18 08:37:26,380 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 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-18 08:37:29,062 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-18 08:37:31,526 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-18 08:37:33,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (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 (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)) c_main_~main__x1~0))) is different from true [2018-11-18 08:37:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:42,901 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-18 08:37:42,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:37:42,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-11-18 08:37:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:37:42,902 INFO L225 Difference]: With dead ends: 18 [2018-11-18 08:37:42,903 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 08:37:42,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=30, Invalid=45, Unknown=13, NotChecked=152, Total=240 [2018-11-18 08:37:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 08:37:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 08:37:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 08:37:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 08:37:42,907 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-18 08:37:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:37:42,908 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-18 08:37:42,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 08:37:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 08:37:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 08:37:42,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:37:42,909 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:37:42,909 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:37:42,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 5 times [2018-11-18 08:37:42,910 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 08:37:42,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:37:42,913 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-18 08:37:44,645 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-18 08:37:44,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:37:44,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:47,020 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .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-18 08:37:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-18 08:37:47,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:37:49,268 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-18 08:37:51,490 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-18 08:37:53,929 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-18 08:37:56,376 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-18 08:37:59,047 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-18 08:38:01,719 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-18 08:38:04,624 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-18 08:38:07,520 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-18 08:38:10,588 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-18 08:38:13,658 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-18 08:38:13,679 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-18 08:38:13,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:38:13,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 08:38:13,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 08:38:13,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 08:38:13,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=44, Unknown=11, NotChecked=102, Total=182 [2018-11-18 08:38:13,700 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-11-18 08:38:16,820 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-18 08:38:19,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 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-18 08:38:22,420 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-18 08:38:24,886 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-18 08:38:27,120 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-18 08:38:29,357 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .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 c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-18 08:38:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:38:35,726 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-18 08:38:35,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 08:38:35,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-11-18 08:38:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:38:35,726 INFO L225 Difference]: With dead ends: 19 [2018-11-18 08:38:35,727 INFO L226 Difference]: Without dead ends: 16 [2018-11-18 08:38:35,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=37, Invalid=50, Unknown=17, NotChecked=276, Total=380 [2018-11-18 08:38:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-18 08:38:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 08:38:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 08:38:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-18 08:38:35,730 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-18 08:38:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:38:35,731 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-18 08:38:35,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 08:38:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-18 08:38:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 08:38:35,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:38:35,732 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:38:35,732 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:38:35,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:38:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 6 times [2018-11-18 08:38:35,732 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 08:38:35,732 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:38:35,735 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-18 08:38:37,452 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-18 08:38:37,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:38:37,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:38:39,850 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-18 08:38:39,853 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-18 08:38:39,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:38:42,116 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-18 08:38:44,343 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-18 08:38:46,790 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-18 08:38:49,234 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-18 08:38:51,912 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-18 08:38:54,583 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-18 08:38:57,488 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-18 08:39:00,384 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-18 08:39:03,506 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-18 08:39:06,626 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-18 08:39:09,962 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-18 08:39:13,319 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-18 08:39:13,342 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-18 08:39:13,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:39:13,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-18 08:39:13,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 08:39:13,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 08:39:13,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=74, Unknown=13, NotChecked=154, Total=272 [2018-11-18 08:39:13,365 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-11-18 08:39:16,725 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 c_main_~main__x1~0) .cse2))) .cse2))) .cse2))) .cse2))) .cse2)))) (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse2)) .cse1)) (fp.eq .cse1 .cse0))) (= ((_ 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-18 08:39:19,878 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-18 08:39:22,847 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .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 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1)))))) is different from true [2018-11-18 08:39:25,526 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 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))))) (= ((_ 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-18 08:39:27,994 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 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-18 08:39:33,953 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 ((_ 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-18 08:39:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:39:38,803 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-18 08:39:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:39:38,803 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-11-18 08:39:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:39:38,804 INFO L225 Difference]: With dead ends: 20 [2018-11-18 08:39:38,804 INFO L226 Difference]: Without dead ends: 17 [2018-11-18 08:39:38,804 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=43, Invalid=80, Unknown=19, NotChecked=364, Total=506 [2018-11-18 08:39:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-18 08:39:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 08:39:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 08:39:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-18 08:39:38,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-18 08:39:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:39:38,809 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-18 08:39:38,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 08:39:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 08:39:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 08:39:38,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:39:38,809 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:39:38,809 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:39:38,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:39:38,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 7 times [2018-11-18 08:39:38,810 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 08:39:38,810 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2397b19-c8c9-4666-8156-c5cb4fdec87c/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-18 08:39:38,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:39:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:39:40,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:40:00,844 WARN L180 SmtUtils]: Spent 5.43 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 08:40:00,847 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-18 08:40:00,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:40:05,331 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-18 08:40:09,205 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-18 08:40:11,665 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-18 08:40:14,321 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-18 08:40:17,011 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-18 08:40:19,944 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-18 08:40:22,865 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-18 08:40:26,033 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-18 08:40:29,181 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-18 08:40:32,555 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-18 08:40:35,929 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-18 08:40:38,069 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-18 08:40:38,270 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2018-11-18 08:40:38,270 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-18 08:40:38,273 INFO L168 Benchmark]: Toolchain (without parser) took 322970.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 948.7 MB in the beginning and 870.5 MB in the end (delta: 78.2 MB). Peak memory consumption was 210.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:38,274 INFO L168 Benchmark]: CDTParser took 0.13 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-18 08:40:38,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.72 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:38,274 INFO L168 Benchmark]: Boogie Preprocessor took 21.90 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:38,275 INFO L168 Benchmark]: RCFGBuilder took 2341.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:38,276 INFO L168 Benchmark]: TraceAbstraction took 320444.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.5 MB in the end (delta: 240.0 MB). Peak memory consumption was 240.0 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:38,278 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.13 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 159.72 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.90 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2341.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 320444.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.5 MB in the end (delta: 240.0 MB). Peak memory consumption was 240.0 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...