./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/Double_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/Double_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 47ed977f76c934f7398d12ebfeb1101009979bf5 ............................................................................................................................................................................................................................................. 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/Double_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 47ed977f76c934f7398d12ebfeb1101009979bf5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:51:05,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:51:05,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:51:05,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:51:05,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:51:05,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:51:05,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:51:05,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:51:05,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:51:05,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:51:05,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:51:05,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:51:05,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:51:05,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:51:05,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:51:05,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:51:05,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:51:05,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:51:05,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:51:05,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:51:05,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:51:05,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:51:05,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:51:05,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:51:05,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:51:05,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:51:05,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:51:05,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:51:05,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:51:05,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:51:05,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:51:05,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:51:05,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:51:05,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:51:05,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:51:05,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:51:05,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:51:05,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:51:05,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:51:05,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:51:05,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:51:05,156 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:51:05,193 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:51:05,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:51:05,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:51:05,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:51:05,201 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:51:05,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:51:05,201 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:51:05,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 22:51:05,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:51:05,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:51:05,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:51:05,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:51:05,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:51:05,203 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:51:05,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:51:05,204 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:51:05,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:51:05,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:51:05,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:51:05,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:51:05,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:51:05,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:51:05,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:51:05,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:51:05,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:51:05,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 22:51:05,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 22:51:05,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:51:05,207 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:51:05,208 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 -> 47ed977f76c934f7398d12ebfeb1101009979bf5 [2020-10-24 22:51:05,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:51:05,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:51:05,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:51:05,731 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:51:05,733 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:51:05,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-10-24 22:51:05,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c849d08a/c112eaf220e1437daf0d0fb84079a8b0/FLAGebe99c01f [2020-10-24 22:51:06,470 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:51:06,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-10-24 22:51:06,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c849d08a/c112eaf220e1437daf0d0fb84079a8b0/FLAGebe99c01f [2020-10-24 22:51:06,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c849d08a/c112eaf220e1437daf0d0fb84079a8b0 [2020-10-24 22:51:06,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:51:06,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:51:06,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:51:06,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:51:06,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:51:06,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:51:06" (1/1) ... [2020-10-24 22:51:06,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a53346f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:06, skipping insertion in model container [2020-10-24 22:51:06,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:51:06" (1/1) ... [2020-10-24 22:51:06,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:51:06,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:51:07,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:51:07,125 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:51:07,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:51:07,158 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:51:07,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07 WrapperNode [2020-10-24 22:51:07,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:51:07,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:51:07,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:51:07,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:51:07,171 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:51:07" (1/1) ... [2020-10-24 22:51:07,180 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:51:07" (1/1) ... [2020-10-24 22:51:07,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:51:07,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:51:07,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:51:07,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:51:07,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07" (1/1) ... [2020-10-24 22:51:07,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07" (1/1) ... [2020-10-24 22:51:07,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07" (1/1) ... [2020-10-24 22:51:07,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07" (1/1) ... [2020-10-24 22:51:07,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07" (1/1) ... [2020-10-24 22:51:07,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07" (1/1) ... [2020-10-24 22:51:07,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07" (1/1) ... [2020-10-24 22:51:07,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:51:07,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:51:07,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:51:07,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:51:07,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07" (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:51:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:51:07,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:51:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 22:51:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:51:07,570 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:51:07,572 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-24 22:51:07,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:51:07 BoogieIcfgContainer [2020-10-24 22:51:07,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:51:07,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:51:07,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:51:07,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:51:07,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:51:06" (1/3) ... [2020-10-24 22:51:07,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b6a462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:51:07, skipping insertion in model container [2020-10-24 22:51:07,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:07" (2/3) ... [2020-10-24 22:51:07,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b6a462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:51:07, skipping insertion in model container [2020-10-24 22:51:07,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:51:07" (3/3) ... [2020-10-24 22:51:07,606 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2020-10-24 22:51:07,640 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:51:07,649 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:51:07,670 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:51:07,700 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:51:07,701 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:51:07,701 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:51:07,701 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:51:07,701 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:51:07,702 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:51:07,702 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:51:07,707 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:51:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-10-24 22:51:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-24 22:51:07,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:51:07,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-24 22:51:07,734 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:51:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:51:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-10-24 22:51:07,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 22:51:07,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897860152] [2020-10-24 22:51:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 22:51:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:51:07,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:51:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:51:07,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:51:07,946 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 22:51:07,947 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 22:51:07,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 22:51:07,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:51:07 BoogieIcfgContainer [2020-10-24 22:51:07,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 22:51:07,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 22:51:07,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 22:51:07,984 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 22:51:07,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:51:07" (3/4) ... [2020-10-24 22:51:07,989 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 22:51:07,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 22:51:07,994 INFO L168 Benchmark]: Toolchain (without parser) took 1129.38 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 21.4 MB in the beginning and 30.0 MB in the end (delta: -8.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. [2020-10-24 22:51:07,995 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 35.7 MB. Free memory was 18.5 MB in the beginning and 18.5 MB in the end (delta: 26.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:51:07,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.95 ms. Allocated memory is still 44.0 MB. Free memory was 20.8 MB in the beginning and 20.8 MB in the end (delta: -47.9 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-24 22:51:07,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.71 ms. Allocated memory is still 44.0 MB. Free memory was 20.8 MB in the beginning and 19.4 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:51:07,999 INFO L168 Benchmark]: Boogie Preprocessor took 21.18 ms. Allocated memory is still 44.0 MB. Free memory was 19.4 MB in the beginning and 18.5 MB in the end (delta: 920.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:51:08,000 INFO L168 Benchmark]: RCFGBuilder took 353.40 ms. Allocated memory is still 44.0 MB. Free memory was 18.5 MB in the beginning and 22.0 MB in the end (delta: -3.5 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2020-10-24 22:51:08,002 INFO L168 Benchmark]: TraceAbstraction took 401.16 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 21.6 MB in the beginning and 30.2 MB in the end (delta: -8.6 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-10-24 22:51:08,003 INFO L168 Benchmark]: Witness Printer took 6.80 ms. Allocated memory is still 54.5 MB. Free memory was 30.2 MB in the beginning and 30.0 MB in the end (delta: 225.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:51:08,008 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.38 ms. Allocated memory is still 35.7 MB. Free memory was 18.5 MB in the beginning and 18.5 MB in the end (delta: 26.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 290.95 ms. Allocated memory is still 44.0 MB. Free memory was 20.8 MB in the beginning and 20.8 MB in the end (delta: -47.9 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.71 ms. Allocated memory is still 44.0 MB. Free memory was 20.8 MB in the beginning and 19.4 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.18 ms. Allocated memory is still 44.0 MB. Free memory was 19.4 MB in the beginning and 18.5 MB in the end (delta: 920.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 353.40 ms. Allocated memory is still 44.0 MB. Free memory was 18.5 MB in the beginning and 22.0 MB in the end (delta: -3.5 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 401.16 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 21.6 MB in the beginning and 30.2 MB in the end (delta: -8.6 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * Witness Printer took 6.80 ms. Allocated memory is still 54.5 MB. Free memory was 30.2 MB in the beginning and 30.0 MB in the end (delta: 225.7 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 someBinaryDOUBLEComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] double main__x = 1.0; [L10] double main__x1 = main__x / 1.6; 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", "Double_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.2s, 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:51:10,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:51:10,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:51:10,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:51:10,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:51:10,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:51:10,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:51:10,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:51:10,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:51:10,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:51:10,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:51:10,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:51:10,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:51:10,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:51:10,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:51:10,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:51:10,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:51:10,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:51:10,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:51:10,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:51:10,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:51:10,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:51:10,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:51:10,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:51:10,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:51:10,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:51:10,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:51:10,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:51:10,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:51:10,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:51:10,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:51:10,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:51:10,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:51:10,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:51:10,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:51:10,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:51:10,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:51:10,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:51:10,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:51:10,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:51:10,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:51:10,941 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:51:11,011 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:51:11,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:51:11,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:51:11,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:51:11,015 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:51:11,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:51:11,016 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:51:11,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:51:11,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:51:11,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:51:11,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:51:11,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:51:11,019 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 22:51:11,019 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 22:51:11,019 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:51:11,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:51:11,020 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:51:11,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:51:11,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:51:11,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:51:11,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:51:11,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:51:11,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:51:11,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:51:11,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:51:11,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:51:11,023 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 22:51:11,023 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 22:51:11,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:51:11,023 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:51:11,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 22:51:11,024 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 -> 47ed977f76c934f7398d12ebfeb1101009979bf5 [2020-10-24 22:51:11,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:51:11,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:51:11,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:51:11,515 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:51:11,515 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:51:11,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-10-24 22:51:11,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/858f79451/bdcd9be02a514b09a751f964328a287e/FLAG0012340f1 [2020-10-24 22:51:12,281 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:51:12,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-10-24 22:51:12,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/858f79451/bdcd9be02a514b09a751f964328a287e/FLAG0012340f1 [2020-10-24 22:51:12,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/858f79451/bdcd9be02a514b09a751f964328a287e [2020-10-24 22:51:12,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:51:12,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:51:12,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:51:12,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:51:12,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:51:12,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:51:12" (1/1) ... [2020-10-24 22:51:12,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170069cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:12, skipping insertion in model container [2020-10-24 22:51:12,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:51:12" (1/1) ... [2020-10-24 22:51:12,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:51:12,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:51:12,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:51:12,994 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:51:13,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:51:13,032 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:51:13,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13 WrapperNode [2020-10-24 22:51:13,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:51:13,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:51:13,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:51:13,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:51:13,044 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:51:13" (1/1) ... [2020-10-24 22:51:13,054 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:51:13" (1/1) ... [2020-10-24 22:51:13,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:51:13,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:51:13,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:51:13,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:51:13,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13" (1/1) ... [2020-10-24 22:51:13,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13" (1/1) ... [2020-10-24 22:51:13,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13" (1/1) ... [2020-10-24 22:51:13,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13" (1/1) ... [2020-10-24 22:51:13,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13" (1/1) ... [2020-10-24 22:51:13,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13" (1/1) ... [2020-10-24 22:51:13,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13" (1/1) ... [2020-10-24 22:51:13,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:51:13,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:51:13,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:51:13,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:51:13,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13" (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:51:13,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:51:13,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:51:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 22:51:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:51:17,690 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:51:17,690 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-24 22:51:17,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:51:17 BoogieIcfgContainer [2020-10-24 22:51:17,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:51:17,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:51:17,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:51:17,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:51:17,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:51:12" (1/3) ... [2020-10-24 22:51:17,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e539b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:51:17, skipping insertion in model container [2020-10-24 22:51:17,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:51:13" (2/3) ... [2020-10-24 22:51:17,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e539b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:51:17, skipping insertion in model container [2020-10-24 22:51:17,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:51:17" (3/3) ... [2020-10-24 22:51:17,702 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2020-10-24 22:51:17,714 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:51:17,720 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:51:17,733 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:51:17,760 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:51:17,761 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:51:17,761 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:51:17,761 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:51:17,761 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:51:17,761 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:51:17,762 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:51:17,762 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:51:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-10-24 22:51:17,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-24 22:51:17,781 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:51:17,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-24 22:51:17,783 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:51:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:51:17,789 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-10-24 22:51:17,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:51:17,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051179697] [2020-10-24 22:51:17,801 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:51:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:51:18,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-24 22:51:18,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:51:21,613 WARN L193 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 11 [2020-10-24 22:51:21,620 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:51:21,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:51:27,639 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.eq (fp.div c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) .cse0))) is different from true [2020-10-24 22:51:27,640 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:51:27,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051179697] [2020-10-24 22:51:27,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:51:27,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-10-24 22:51:27,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119820023] [2020-10-24 22:51:27,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 22:51:27,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:51:27,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 22:51:27,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2020-10-24 22:51:27,666 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 6 states. [2020-10-24 22:51:34,962 WARN L193 SmtUtils]: Spent 3.90 s on a formula simplification that was a NOOP. DAG size: 13 [2020-10-24 22:51:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:51:38,368 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-10-24 22:51:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 22:51:38,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2020-10-24 22:51:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:51:38,386 INFO L225 Difference]: With dead ends: 17 [2020-10-24 22:51:38,386 INFO L226 Difference]: Without dead ends: 7 [2020-10-24 22:51:38,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=15, Invalid=17, Unknown=2, NotChecked=8, Total=42 [2020-10-24 22:51:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-10-24 22:51:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-10-24 22:51:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-24 22:51:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-10-24 22:51:38,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2020-10-24 22:51:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:51:38,427 INFO L481 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-10-24 22:51:38,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 22:51:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-10-24 22:51:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-24 22:51:38,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:51:38,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-24 22:51:38,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 22:51:38,638 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:51:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:51:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2020-10-24 22:51:38,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:51:38,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480047090] [2020-10-24 22:51:38,643 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:51:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:51:40,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-24 22:51:40,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:51:46,691 WARN L193 SmtUtils]: Spent 5.34 s on a formula simplification that was a NOOP. DAG size: 11 [2020-10-24 22:51:48,951 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)))) is different from true [2020-10-24 22:51:48,957 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:51:48,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:51:51,276 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-10-24 22:51:53,567 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-10-24 22:51:56,133 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2020-10-24 22:51:58,743 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2020-10-24 22:51:58,744 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:51:58,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480047090] [2020-10-24 22:51:58,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:51:58,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-10-24 22:51:58,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450689410] [2020-10-24 22:51:58,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 22:51:58,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:51:58,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 22:51:58,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=13, Unknown=5, NotChecked=24, Total=56 [2020-10-24 22:51:58,749 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2020-10-24 22:52:01,379 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2020-10-24 22:52:03,985 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)))) is different from false [2020-10-24 22:52:06,284 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)))) is different from true [2020-10-24 22:52:08,599 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)))) is different from true [2020-10-24 22:52:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:52:13,378 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-10-24 22:52:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 22:52:13,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2020-10-24 22:52:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:52:13,380 INFO L225 Difference]: With dead ends: 11 [2020-10-24 22:52:13,381 INFO L226 Difference]: Without dead ends: 8 [2020-10-24 22:52:13,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=20, Invalid=15, Unknown=9, NotChecked=66, Total=110 [2020-10-24 22:52:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-10-24 22:52:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-10-24 22:52:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-24 22:52:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-10-24 22:52:13,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2020-10-24 22:52:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:52:13,388 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-10-24 22:52:13,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 22:52:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-10-24 22:52:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 22:52:13,389 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:52:13,389 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-10-24 22:52:13,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 22:52:13,594 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:52:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:52:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2020-10-24 22:52:13,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:52:13,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317834448] [2020-10-24 22:52:13,602 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:52:16,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-24 22:52:16,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 22:52:16,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-24 22:52:16,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:52:20,027 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))))) is different from true [2020-10-24 22:52:23,334 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:52:26,245 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0))) is different from false [2020-10-24 22:52:28,832 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2020-10-24 22:52:28,839 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:52:28,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:52:31,204 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from false [2020-10-24 22:52:36,020 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2020-10-24 22:52:38,604 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2020-10-24 22:52:41,503 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-10-24 22:52:44,407 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-10-24 22:52:44,408 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:52:44,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317834448] [2020-10-24 22:52:44,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:52:44,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-10-24 22:52:44,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289077460] [2020-10-24 22:52:44,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 22:52:44,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:52:44,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 22:52:44,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=16, Unknown=9, NotChecked=66, Total=110 [2020-10-24 22:52:44,411 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2020-10-24 22:52:47,356 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:52:49,977 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0))) (or (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)))))) is different from true [2020-10-24 22:52:52,917 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.eq (fp.div 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 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-10-24 22:52:55,354 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.eq (fp.div 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 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-10-24 22:52:58,276 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0))) is different from false [2020-10-24 22:53:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:53:02,949 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-10-24 22:53:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 22:53:02,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2020-10-24 22:53:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:53:02,950 INFO L225 Difference]: With dead ends: 12 [2020-10-24 22:53:02,950 INFO L226 Difference]: Without dead ends: 9 [2020-10-24 22:53:02,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=27, Invalid=19, Unknown=14, NotChecked=150, Total=210 [2020-10-24 22:53:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-10-24 22:53:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-24 22:53:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-24 22:53:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-10-24 22:53:02,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-10-24 22:53:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:53:02,955 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-10-24 22:53:02,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 22:53:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-10-24 22:53:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 22:53:02,956 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:53:02,956 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-10-24 22:53:03,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 22:53:03,162 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:53:03,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:53:03,164 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2020-10-24 22:53:03,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:53:03,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601256379] [2020-10-24 22:53:03,166 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:53:06,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-24 22:53:06,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 22:53:07,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 22:53:07,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:53:09,650 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))))) is different from true [2020-10-24 22:53:12,863 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:53:15,538 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)))) is different from true [2020-10-24 22:53:21,136 WARN L193 SmtUtils]: Spent 3.24 s on a formula simplification that was a NOOP. DAG size: 14 [2020-10-24 22:53:21,141 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:53:21,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:53:25,708 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-10-24 22:53:29,333 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2020-10-24 22:53:31,955 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2020-10-24 22:53:34,908 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2020-10-24 22:53:37,859 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2020-10-24 22:53:41,230 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2020-10-24 22:53:44,530 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2020-10-24 22:53:44,531 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:53:44,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601256379] [2020-10-24 22:53:44,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:53:44,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-10-24 22:53:44,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443379582] [2020-10-24 22:53:44,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 22:53:44,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:53:44,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 22:53:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=15, Unknown=11, NotChecked=84, Total=132 [2020-10-24 22:53:44,534 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 12 states. [2020-10-24 22:53:47,912 WARN L860 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:53:50,862 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from true [2020-10-24 22:53:54,270 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from false [2020-10-24 22:53:57,709 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from true [2020-10-24 22:54:01,060 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)))) is different from false [2020-10-24 22:54:03,348 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)))) is different from true [2020-10-24 22:54:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:54:08,676 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-10-24 22:54:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 22:54:08,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2020-10-24 22:54:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:54:08,678 INFO L225 Difference]: With dead ends: 13 [2020-10-24 22:54:08,678 INFO L226 Difference]: Without dead ends: 10 [2020-10-24 22:54:08,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=30, Invalid=17, Unknown=17, NotChecked=176, Total=240 [2020-10-24 22:54:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-10-24 22:54:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-10-24 22:54:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-24 22:54:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-10-24 22:54:08,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-10-24 22:54:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:54:08,682 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-10-24 22:54:08,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 22:54:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-10-24 22:54:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-24 22:54:08,683 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:54:08,683 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-10-24 22:54:08,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 22:54:08,887 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:54:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:54:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2020-10-24 22:54:08,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:54:08,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909924539] [2020-10-24 22:54:08,890 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:54:13,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-24 22:54:13,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 22:54:13,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 22:54:13,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:54:19,594 WARN L193 SmtUtils]: Spent 5.15 s on a formula simplification that was a NOOP. DAG size: 11 [2020-10-24 22:54:22,916 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:54:25,625 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)))) is different from true [2020-10-24 22:54:28,979 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-10-24 22:54:31,542 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2020-10-24 22:54:31,546 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:54:31,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:54:33,867 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-10-24 22:54:36,167 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-10-24 22:54:38,757 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2020-10-24 22:54:41,344 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2020-10-24 22:54:44,253 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2020-10-24 22:54:47,165 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2020-10-24 22:54:51,307 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2020-10-24 22:54:55,214 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2020-10-24 22:54:59,290 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2020-10-24 22:55:03,316 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2020-10-24 22:55:03,316 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:55:03,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909924539] [2020-10-24 22:55:03,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:55:03,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-10-24 22:55:03,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112030269] [2020-10-24 22:55:03,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 22:55:03,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:55:03,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 22:55:03,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=16, Unknown=14, NotChecked=126, Total=182 [2020-10-24 22:55:03,319 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 14 states. [2020-10-24 22:55:07,327 WARN L860 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 22:55:10,591 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)))) is different from false [2020-10-24 22:55:14,627 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)))) is different from true [2020-10-24 22:55:18,727 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from false [2020-10-24 22:55:22,815 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from true [2020-10-24 22:55:26,949 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1)))) is different from true [2020-10-24 22:55:29,357 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-10-24 22:55:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 22:55:29,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 22:55:29,561 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:829) 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 22:55:29,568 INFO L168 Benchmark]: Toolchain (without parser) took 256872.51 ms. Allocated memory was 41.9 MB in the beginning and 56.6 MB in the end (delta: 14.7 MB). Free memory was 18.1 MB in the beginning and 21.6 MB in the end (delta: -3.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. [2020-10-24 22:55:29,569 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 41.9 MB. Free memory was 27.1 MB in the beginning and 27.1 MB in the end (delta: 26.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:55:29,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.80 ms. Allocated memory was 41.9 MB in the beginning and 56.6 MB in the end (delta: 14.7 MB). Free memory was 17.5 MB in the beginning and 31.5 MB in the end (delta: -14.1 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-10-24 22:55:29,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 56.6 MB. Free memory was 31.5 MB in the beginning and 30.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:55:29,575 INFO L168 Benchmark]: Boogie Preprocessor took 29.98 ms. Allocated memory is still 56.6 MB. Free memory was 30.2 MB in the beginning and 29.1 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:55:29,576 INFO L168 Benchmark]: RCFGBuilder took 4585.89 ms. Allocated memory is still 56.6 MB. Free memory was 29.1 MB in the beginning and 31.5 MB in the end (delta: -2.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2020-10-24 22:55:29,577 INFO L168 Benchmark]: TraceAbstraction took 251871.46 ms. Allocated memory is still 56.6 MB. Free memory was 31.2 MB in the beginning and 21.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. [2020-10-24 22:55:29,581 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.27 ms. Allocated memory is still 41.9 MB. Free memory was 27.1 MB in the beginning and 27.1 MB in the end (delta: 26.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 325.80 ms. Allocated memory was 41.9 MB in the beginning and 56.6 MB in the end (delta: 14.7 MB). Free memory was 17.5 MB in the beginning and 31.5 MB in the end (delta: -14.1 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 56.6 MB. Free memory was 31.5 MB in the beginning and 30.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.98 ms. Allocated memory is still 56.6 MB. Free memory was 30.2 MB in the beginning and 29.1 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4585.89 ms. Allocated memory is still 56.6 MB. Free memory was 29.1 MB in the beginning and 31.5 MB in the end (delta: -2.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 251871.46 ms. Allocated memory is still 56.6 MB. Free memory was 31.2 MB in the beginning and 21.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.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...