./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 ............................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-a4ecdab [2020-10-24 22:54:34,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:54:34,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:54:34,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:54:34,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:54:34,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:54:34,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:54:34,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:54:34,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:54:34,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:54:34,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:54:34,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:54:34,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:54:34,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:54:34,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:54:34,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:54:34,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:54:34,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:54:34,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:54:34,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:54:34,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:54:34,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:54:34,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:54:34,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:54:34,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:54:34,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:54:34,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:54:34,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:54:34,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:54:34,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:54:34,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:54:34,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:54:34,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:54:34,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:54:34,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:54:34,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:54:34,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:54:34,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:54:34,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:54:34,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:54:34,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:54:34,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 22:54:34,231 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:54:34,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:54:34,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:54:34,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:54:34,234 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:54:34,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:54:34,235 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:54:34,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 22:54:34,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:54:34,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:54:34,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:54:34,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:54:34,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:54:34,237 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:54:34,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:54:34,237 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:54:34,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:54:34,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:54:34,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:54:34,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:54:34,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:54:34,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:54:34,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:54:34,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:54:34,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:54:34,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 22:54:34,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 22:54:34,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:54:34,241 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:54:34,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 [2020-10-24 22:54:34,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:54:34,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:54:34,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:54:34,731 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:54:34,732 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:54:34,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2020-10-24 22:54:34,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50dc3ac75/48c16c4db22c4b6691af527e24871e00/FLAG46a956da9 [2020-10-24 22:54:35,457 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:54:35,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2020-10-24 22:54:35,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50dc3ac75/48c16c4db22c4b6691af527e24871e00/FLAG46a956da9 [2020-10-24 22:54:35,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50dc3ac75/48c16c4db22c4b6691af527e24871e00 [2020-10-24 22:54:35,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:54:35,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:54:35,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:54:35,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:54:35,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:54:35,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:54:35" (1/1) ... [2020-10-24 22:54:35,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae97d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:35, skipping insertion in model container [2020-10-24 22:54:35,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:54:35" (1/1) ... [2020-10-24 22:54:35,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:54:35,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:54:36,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:54:36,165 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:54:36,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:54:36,203 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:54:36,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36 WrapperNode [2020-10-24 22:54:36,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:54:36,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:54:36,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:54:36,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:54:36,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... [2020-10-24 22:54:36,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... [2020-10-24 22:54:36,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:54:36,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:54:36,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:54:36,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:54:36,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... [2020-10-24 22:54:36,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... [2020-10-24 22:54:36,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... [2020-10-24 22:54:36,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... [2020-10-24 22:54:36,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... [2020-10-24 22:54:36,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... [2020-10-24 22:54:36,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... [2020-10-24 22:54:36,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:54:36,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:54:36,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:54:36,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:54:36,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 22:54:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:54:36,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:54:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 22:54:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:54:36,601 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:54:36,601 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-24 22:54:36,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:54:36 BoogieIcfgContainer [2020-10-24 22:54:36,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:54:36,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:54:36,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:54:36,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:54:36,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:54:35" (1/3) ... [2020-10-24 22:54:36,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418e3a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:54:36, skipping insertion in model container [2020-10-24 22:54:36,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:36" (2/3) ... [2020-10-24 22:54:36,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418e3a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:54:36, skipping insertion in model container [2020-10-24 22:54:36,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:54:36" (3/3) ... [2020-10-24 22:54:36,616 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2020-10-24 22:54:36,631 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:54:36,638 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:54:36,655 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:54:36,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:54:36,688 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:54:36,688 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:54:36,688 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:54:36,689 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:54:36,689 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:54:36,689 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:54:36,690 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:54:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-10-24 22:54:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-24 22:54:36,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:54:36,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-24 22:54:36,729 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:54:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:54:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-10-24 22:54:36,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 22:54:36,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506167932] [2020-10-24 22:54:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 22:54:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:54:36,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:54:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:54:36,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:54:37,026 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 22:54:37,027 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 22:54:37,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 22:54:37,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:54:37 BoogieIcfgContainer [2020-10-24 22:54:37,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 22:54:37,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 22:54:37,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 22:54:37,071 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 22:54:37,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:54:36" (3/4) ... [2020-10-24 22:54:37,076 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 22:54:37,077 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 22:54:37,083 INFO L168 Benchmark]: Toolchain (without parser) took 1257.96 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 27.4 MB in the beginning and 37.3 MB in the end (delta: -9.9 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. [2020-10-24 22:54:37,086 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 50.3 MB. Free memory was 30.7 MB in the beginning and 30.7 MB in the end (delta: 63.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:54:37,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.05 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 26.7 MB in the beginning and 45.5 MB in the end (delta: -18.8 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-24 22:54:37,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.96 ms. Allocated memory is still 67.1 MB. Free memory was 45.3 MB in the beginning and 43.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:54:37,092 INFO L168 Benchmark]: Boogie Preprocessor took 22.13 ms. Allocated memory is still 67.1 MB. Free memory was 43.9 MB in the beginning and 43.0 MB in the end (delta: 861.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:54:37,093 INFO L168 Benchmark]: RCFGBuilder took 335.74 ms. Allocated memory is still 67.1 MB. Free memory was 43.0 MB in the beginning and 50.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. [2020-10-24 22:54:37,094 INFO L168 Benchmark]: TraceAbstraction took 461.65 ms. Allocated memory is still 67.1 MB. Free memory was 49.9 MB in the beginning and 37.6 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-24 22:54:37,095 INFO L168 Benchmark]: Witness Printer took 6.28 ms. Allocated memory is still 67.1 MB. Free memory was 37.6 MB in the beginning and 37.3 MB in the end (delta: 293.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:54:37,112 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 50.3 MB. Free memory was 30.7 MB in the beginning and 30.7 MB in the end (delta: 63.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 372.05 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 26.7 MB in the beginning and 45.5 MB in the end (delta: -18.8 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.96 ms. Allocated memory is still 67.1 MB. Free memory was 45.3 MB in the beginning and 43.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.13 ms. Allocated memory is still 67.1 MB. Free memory was 43.9 MB in the beginning and 43.0 MB in the end (delta: 861.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 335.74 ms. Allocated memory is still 67.1 MB. Free memory was 43.0 MB in the beginning and 50.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 461.65 ms. Allocated memory is still 67.1 MB. Free memory was 49.9 MB in the beginning and 37.6 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Witness Printer took 6.28 ms. Allocated memory is still 67.1 MB. Free memory was 37.6 MB in the beginning and 37.3 MB in the end (delta: 293.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 1.600000023841858; VAL [__return_main=0] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L4] __assert_fail("0", "Float_div_bad.i.p+cfa-reducer.c", 4, "reach_error") VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-10-24 22:54:39,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:54:39,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:54:39,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:54:39,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:54:39,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:54:39,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:54:39,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:54:39,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:54:39,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:54:39,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:54:39,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:54:39,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:54:39,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:54:39,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:54:39,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:54:39,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:54:39,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:54:39,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:54:39,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:54:39,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:54:39,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:54:39,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:54:39,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:54:39,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:54:39,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:54:39,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:54:39,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:54:39,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:54:39,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:54:39,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:54:39,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:54:39,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:54:39,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:54:39,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:54:39,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:54:39,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:54:39,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:54:39,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:54:39,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:54:39,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:54:40,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 22:54:40,029 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:54:40,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:54:40,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:54:40,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:54:40,032 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:54:40,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:54:40,032 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:54:40,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:54:40,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:54:40,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:54:40,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:54:40,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:54:40,033 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 22:54:40,034 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 22:54:40,034 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:54:40,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:54:40,034 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:54:40,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:54:40,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:54:40,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:54:40,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:54:40,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:54:40,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:54:40,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:54:40,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:54:40,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:54:40,036 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 22:54:40,037 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 22:54:40,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:54:40,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:54:40,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 22:54:40,037 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 [2020-10-24 22:54:40,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:54:40,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:54:40,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:54:40,586 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:54:40,594 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:54:40,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2020-10-24 22:54:40,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6551e7c2/caa4268d2bc1438b9a4dd63cd960d661/FLAG7829cb183 [2020-10-24 22:54:41,345 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:54:41,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2020-10-24 22:54:41,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6551e7c2/caa4268d2bc1438b9a4dd63cd960d661/FLAG7829cb183 [2020-10-24 22:54:41,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6551e7c2/caa4268d2bc1438b9a4dd63cd960d661 [2020-10-24 22:54:41,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:54:41,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:54:41,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:54:41,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:54:41,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:54:41,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:54:41" (1/1) ... [2020-10-24 22:54:41,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a843a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:41, skipping insertion in model container [2020-10-24 22:54:41,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:54:41" (1/1) ... [2020-10-24 22:54:41,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:54:41,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:54:41,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:54:41,997 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:54:42,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:54:42,047 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:54:42,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42 WrapperNode [2020-10-24 22:54:42,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:54:42,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:54:42,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:54:42,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:54:42,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... [2020-10-24 22:54:42,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... [2020-10-24 22:54:42,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:54:42,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:54:42,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:54:42,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:54:42,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... [2020-10-24 22:54:42,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... [2020-10-24 22:54:42,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... [2020-10-24 22:54:42,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... [2020-10-24 22:54:42,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... [2020-10-24 22:54:42,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... [2020-10-24 22:54:42,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... [2020-10-24 22:54:42,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:54:42,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:54:42,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:54:42,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:54:42,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 22:54:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:54:42,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:54:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 22:54:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:54:47,004 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:54:47,004 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-24 22:54:47,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:54:47 BoogieIcfgContainer [2020-10-24 22:54:47,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:54:47,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:54:47,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:54:47,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:54:47,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:54:41" (1/3) ... [2020-10-24 22:54:47,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3792ddd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:54:47, skipping insertion in model container [2020-10-24 22:54:47,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:54:42" (2/3) ... [2020-10-24 22:54:47,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3792ddd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:54:47, skipping insertion in model container [2020-10-24 22:54:47,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:54:47" (3/3) ... [2020-10-24 22:54:47,020 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2020-10-24 22:54:47,033 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:54:47,038 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:54:47,051 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:54:47,076 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:54:47,077 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:54:47,077 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:54:47,077 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:54:47,077 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:54:47,077 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:54:47,077 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:54:47,077 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:54:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-10-24 22:54:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-24 22:54:47,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:54:47,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-24 22:54:47,098 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:54:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:54:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-10-24 22:54:47,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:54:47,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151240737] [2020-10-24 22:54:47,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 22:54:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:54:48,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-24 22:54:48,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:54:50,574 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))))) is different from true [2020-10-24 22:54:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:54:50,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:54:54,598 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) .cse0))) is different from true [2020-10-24 22:54:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:54:54,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151240737] [2020-10-24 22:54:54,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:54:54,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-10-24 22:54:54,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599714689] [2020-10-24 22:54:54,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 22:54:54,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:54:54,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 22:54:54,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2020-10-24 22:54:54,641 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 6 states. [2020-10-24 22:54:56,965 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) .cse0)))) is different from true [2020-10-24 22:54:59,277 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))))) is different from true [2020-10-24 22:55:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:55:01,091 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-10-24 22:55:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 22:55:01,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2020-10-24 22:55:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:55:01,103 INFO L225 Difference]: With dead ends: 17 [2020-10-24 22:55:01,103 INFO L226 Difference]: Without dead ends: 7 [2020-10-24 22:55:01,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13, Invalid=11, Unknown=4, NotChecked=28, Total=56 [2020-10-24 22:55:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-10-24 22:55:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-10-24 22:55:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-24 22:55:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-10-24 22:55:01,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2020-10-24 22:55:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:55:01,142 INFO L481 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-10-24 22:55:01,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 22:55:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-10-24 22:55:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-24 22:55:01,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:55:01,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-24 22:55:01,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 22:55:01,357 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:55:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:55:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2020-10-24 22:55:01,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:55:01,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293283318] [2020-10-24 22:55:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 22:55:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:55:03,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-24 22:55:03,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:55:05,486 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:55:16,673 WARN L193 SmtUtils]: Spent 7.05 s on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 22:55:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-10-24 22:55:16,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:55:20,052 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-10-24 22:55:22,377 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-10-24 22:55:24,973 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 22:55:27,581 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 22:55:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-10-24 22:55:27,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293283318] [2020-10-24 22:55:27,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:55:27,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-10-24 22:55:27,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894252790] [2020-10-24 22:55:27,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 22:55:27,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:55:27,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 22:55:27,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=12, Unknown=6, NotChecked=24, Total=56 [2020-10-24 22:55:27,587 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2020-10-24 22:55:30,233 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-10-24 22:55:32,850 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-10-24 22:55:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:55:37,988 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-10-24 22:55:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 22:55:37,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2020-10-24 22:55:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:55:37,989 INFO L225 Difference]: With dead ends: 11 [2020-10-24 22:55:37,990 INFO L226 Difference]: Without dead ends: 8 [2020-10-24 22:55:37,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=18, Invalid=14, Unknown=8, NotChecked=50, Total=90 [2020-10-24 22:55:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-10-24 22:55:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-10-24 22:55:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-24 22:55:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-10-24 22:55:37,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2020-10-24 22:55:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:55:37,999 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-10-24 22:55:37,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 22:55:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-10-24 22:55:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 22:55:38,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:55:38,001 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-10-24 22:55:38,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 22:55:38,212 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:55:38,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:55:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2020-10-24 22:55:38,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:55:38,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074905267] [2020-10-24 22:55:38,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 22:55:41,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-24 22:55:41,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 22:55:41,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-24 22:55:41,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:55:43,554 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:55:46,172 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:55:49,066 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-10-24 22:55:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-10-24 22:55:49,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:55:51,481 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2020-10-24 22:55:53,785 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2020-10-24 22:55:56,415 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-10-24 22:55:59,016 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-10-24 22:56:01,908 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2020-10-24 22:56:04,805 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-10-24 22:56:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-10-24 22:56:04,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074905267] [2020-10-24 22:56:04,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:56:04,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-10-24 22:56:04,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660990538] [2020-10-24 22:56:04,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 22:56:04,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:56:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 22:56:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=16, Unknown=9, NotChecked=66, Total=110 [2020-10-24 22:56:04,810 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2020-10-24 22:56:07,747 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))))) is different from true [2020-10-24 22:56:10,681 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2020-10-24 22:56:13,595 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2020-10-24 22:56:16,518 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-10-24 22:56:19,447 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-10-24 22:56:22,382 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-10-24 22:56:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:56:27,222 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-10-24 22:56:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 22:56:27,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2020-10-24 22:56:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:56:27,223 INFO L225 Difference]: With dead ends: 12 [2020-10-24 22:56:27,224 INFO L226 Difference]: Without dead ends: 9 [2020-10-24 22:56:27,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=27, Invalid=18, Unknown=15, NotChecked=150, Total=210 [2020-10-24 22:56:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-10-24 22:56:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-24 22:56:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-24 22:56:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-10-24 22:56:27,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-10-24 22:56:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:56:27,230 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-10-24 22:56:27,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 22:56:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-10-24 22:56:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 22:56:27,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:56:27,231 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-10-24 22:56:27,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 22:56:27,442 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:56:27,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:56:27,443 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2020-10-24 22:56:27,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:56:27,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640842759] [2020-10-24 22:56:27,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 22:56:31,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-24 22:56:31,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 22:56:31,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-24 22:56:31,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:56:33,946 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:56:36,552 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:56:39,482 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-10-24 22:56:43,091 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from false [2020-10-24 22:56:46,503 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-10-24 22:56:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-10-24 22:56:46,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:56:48,857 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2020-10-24 22:56:51,153 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2020-10-24 22:56:53,791 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-10-24 22:56:56,431 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-10-24 22:56:59,415 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-10-24 22:57:02,368 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-10-24 22:57:05,811 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2020-10-24 22:57:09,264 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-10-24 22:57:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-10-24 22:57:09,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640842759] [2020-10-24 22:57:09,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:57:09,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-10-24 22:57:09,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940287490] [2020-10-24 22:57:09,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 22:57:09,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:57:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 22:57:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=16, Unknown=13, NotChecked=104, Total=156 [2020-10-24 22:57:09,269 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 13 states. [2020-10-24 22:57:12,754 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:57:16,449 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2020-10-24 22:57:20,054 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2020-10-24 22:57:23,744 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2020-10-24 22:57:27,367 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2020-10-24 22:57:30,946 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-10-24 22:57:34,730 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from false [2020-10-24 22:57:38,379 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-10-24 22:57:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:57:43,323 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-10-24 22:57:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 22:57:43,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2020-10-24 22:57:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:57:43,326 INFO L225 Difference]: With dead ends: 13 [2020-10-24 22:57:43,326 INFO L226 Difference]: Without dead ends: 10 [2020-10-24 22:57:43,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.6s TimeCoverageRelationStatistics Valid=33, Invalid=18, Unknown=21, NotChecked=234, Total=306 [2020-10-24 22:57:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-10-24 22:57:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-10-24 22:57:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-24 22:57:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-10-24 22:57:43,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-10-24 22:57:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:57:43,335 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-10-24 22:57:43,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 22:57:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-10-24 22:57:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-24 22:57:43,336 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:57:43,336 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-10-24 22:57:43,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 22:57:43,550 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:57:43,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:57:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2020-10-24 22:57:43,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:57:43,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212469499] [2020-10-24 22:57:43,552 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 22:57:47,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-24 22:57:47,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 22:57:48,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 22:57:48,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:57:50,401 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:57:53,024 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:57:55,959 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-10-24 22:57:59,584 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:58:01,917 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-10-24 22:58:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-10-24 22:58:01,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:58:04,280 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-10-24 22:58:08,707 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 22:58:11,339 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 22:58:14,313 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 22:58:17,292 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 22:58:20,969 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 22:58:24,749 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 22:58:28,526 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 22:58:32,317 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 22:58:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-10-24 22:58:32,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212469499] [2020-10-24 22:58:32,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:58:32,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-10-24 22:58:32,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156263334] [2020-10-24 22:58:32,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 22:58:32,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:58:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 22:58:32,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=13, Unknown=14, NotChecked=130, Total=182 [2020-10-24 22:58:32,321 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 14 states. [2020-10-24 22:58:36,043 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-10-24 22:58:39,878 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-10-24 22:58:43,625 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-10-24 22:58:47,499 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-10-24 22:58:51,205 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-10-24 22:58:55,003 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from false [2020-10-24 22:58:58,697 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from true [2020-10-24 22:59:02,437 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-10-24 22:59:04,735 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-10-24 22:59:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:59:09,673 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-10-24 22:59:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 22:59:09,676 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2020-10-24 22:59:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:59:09,676 INFO L225 Difference]: With dead ends: 14 [2020-10-24 22:59:09,677 INFO L226 Difference]: Without dead ends: 11 [2020-10-24 22:59:09,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.6s TimeCoverageRelationStatistics Valid=37, Invalid=16, Unknown=23, NotChecked=304, Total=380 [2020-10-24 22:59:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-10-24 22:59:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-10-24 22:59:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-24 22:59:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-10-24 22:59:09,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2020-10-24 22:59:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:59:09,681 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-10-24 22:59:09,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 22:59:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-10-24 22:59:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 22:59:09,682 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:59:09,682 INFO L422 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2020-10-24 22:59:09,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 22:59:09,883 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:59:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:59:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 5 times [2020-10-24 22:59:09,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:59:09,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314074305] [2020-10-24 22:59:09,886 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 22:59:16,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-10-24 22:59:16,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 22:59:16,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-24 22:59:16,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:59:18,890 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:59:21,555 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:59:24,541 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-10-24 22:59:28,226 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:59:32,029 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:59:34,356 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_ULTIMATE.start_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))))) is different from true [2020-10-24 22:59:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2020-10-24 22:59:34,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:59:36,730 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-10-24 22:59:39,046 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-10-24 22:59:41,715 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 22:59:44,352 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 22:59:47,412 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 22:59:50,391 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 22:59:54,193 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 22:59:58,142 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 23:00:02,196 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 23:00:06,219 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 23:00:10,394 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-10-24 23:00:13,615 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-10-24 23:00:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2020-10-24 23:00:13,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314074305] [2020-10-24 23:00:13,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 23:00:13,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-10-24 23:00:13,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515927472] [2020-10-24 23:00:13,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 23:00:13,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:00:13,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 23:00:13,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=13, Unknown=18, NotChecked=180, Total=240 [2020-10-24 23:00:13,619 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 16 states. [2020-10-24 23:00:17,440 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-10-24 23:00:21,394 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-10-24 23:00:25,208 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-10-24 23:00:29,178 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-10-24 23:00:33,048 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-10-24 23:00:35,515 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-10-24 23:00:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 23:00:35,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-24 23:00:35,718 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:851) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 45 more [2020-10-24 23:00:35,725 INFO L168 Benchmark]: Toolchain (without parser) took 354022.16 ms. Allocated memory is still 48.2 MB. Free memory was 24.1 MB in the beginning and 20.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 1.8 MB. Max. memory is 16.1 GB. [2020-10-24 23:00:35,726 INFO L168 Benchmark]: CDTParser took 3.50 ms. Allocated memory is still 35.7 MB. Free memory is still 19.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:00:35,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.04 ms. Allocated memory is still 48.2 MB. Free memory was 23.4 MB in the beginning and 25.0 MB in the end (delta: -1.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2020-10-24 23:00:35,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.14 ms. Allocated memory is still 48.2 MB. Free memory was 24.8 MB in the beginning and 23.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:00:35,729 INFO L168 Benchmark]: Boogie Preprocessor took 57.45 ms. Allocated memory is still 48.2 MB. Free memory was 23.5 MB in the beginning and 22.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 23:00:35,730 INFO L168 Benchmark]: RCFGBuilder took 4846.95 ms. Allocated memory is still 48.2 MB. Free memory was 22.2 MB in the beginning and 24.8 MB in the end (delta: -2.6 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-10-24 23:00:35,730 INFO L168 Benchmark]: TraceAbstraction took 348714.72 ms. Allocated memory is still 48.2 MB. Free memory was 24.4 MB in the beginning and 20.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-10-24 23:00:35,745 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.50 ms. Allocated memory is still 35.7 MB. Free memory is still 19.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 335.04 ms. Allocated memory is still 48.2 MB. Free memory was 23.4 MB in the beginning and 25.0 MB in the end (delta: -1.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.14 ms. Allocated memory is still 48.2 MB. Free memory was 24.8 MB in the beginning and 23.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.45 ms. Allocated memory is still 48.2 MB. Free memory was 23.5 MB in the beginning and 22.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4846.95 ms. Allocated memory is still 48.2 MB. Free memory was 22.2 MB in the beginning and 24.8 MB in the end (delta: -2.6 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 348714.72 ms. Allocated memory is still 48.2 MB. Free memory was 24.4 MB in the beginning and 20.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 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:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...