./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e1a00cf 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 ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.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 fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 ............................................................................................................................................................................................................................................. 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 ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.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 fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0e1a00c [2020-11-29 12:59:28,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 12:59:28,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 12:59:28,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 12:59:28,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 12:59:28,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 12:59:28,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 12:59:28,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 12:59:28,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 12:59:28,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 12:59:28,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 12:59:28,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 12:59:28,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 12:59:28,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 12:59:28,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 12:59:28,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 12:59:28,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 12:59:28,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 12:59:28,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 12:59:28,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 12:59:28,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 12:59:28,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 12:59:28,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 12:59:28,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 12:59:28,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 12:59:28,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 12:59:28,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 12:59:28,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 12:59:28,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 12:59:28,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 12:59:28,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 12:59:28,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 12:59:28,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 12:59:28,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 12:59:28,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 12:59:28,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 12:59:28,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 12:59:28,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 12:59:28,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 12:59:28,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 12:59:28,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 12:59:28,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 12:59:28,179 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 12:59:28,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 12:59:28,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 12:59:28,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 12:59:28,181 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 12:59:28,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 12:59:28,182 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 12:59:28,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 12:59:28,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 12:59:28,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 12:59:28,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 12:59:28,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 12:59:28,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 12:59:28,184 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 12:59:28,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 12:59:28,184 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 12:59:28,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 12:59:28,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 12:59:28,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 12:59:28,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 12:59:28,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 12:59:28,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 12:59:28,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 12:59:28,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 12:59:28,187 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 12:59:28,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 12:59:28,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 12:59:28,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 12:59:28,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 12:59:28,188 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 -> fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 [2020-11-29 12:59:28,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 12:59:28,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 12:59:28,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 12:59:28,601 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 12:59:28,602 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 12:59:28,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-11-29 12:59:28,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b28f3a9/63c81af0321d4abebfbfb4f64402658a/FLAG274238972 [2020-11-29 12:59:29,223 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 12:59:29,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-11-29 12:59:29,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b28f3a9/63c81af0321d4abebfbfb4f64402658a/FLAG274238972 [2020-11-29 12:59:29,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b28f3a9/63c81af0321d4abebfbfb4f64402658a [2020-11-29 12:59:29,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 12:59:29,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 12:59:29,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 12:59:29,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 12:59:29,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 12:59:29,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13aebea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29, skipping insertion in model container [2020-11-29 12:59:29,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 12:59:29,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 12:59:29,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 12:59:29,836 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 12:59:29,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 12:59:29,870 INFO L208 MainTranslator]: Completed translation [2020-11-29 12:59:29,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29 WrapperNode [2020-11-29 12:59:29,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 12:59:29,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 12:59:29,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 12:59:29,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 12:59:29,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 12:59:29,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 12:59:29,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 12:59:29,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 12:59:29,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (1/1) ... [2020-11-29 12:59:29,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 12:59:29,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 12:59:29,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 12:59:29,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 12:59:29,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (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-11-29 12:59:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 12:59:30,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 12:59:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 12:59:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 12:59:30,276 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 12:59:30,277 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-29 12:59:30,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:59:30 BoogieIcfgContainer [2020-11-29 12:59:30,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 12:59:30,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 12:59:30,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 12:59:30,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 12:59:30,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:59:29" (1/3) ... [2020-11-29 12:59:30,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66214d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:59:30, skipping insertion in model container [2020-11-29 12:59:30,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:29" (2/3) ... [2020-11-29 12:59:30,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66214d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:59:30, skipping insertion in model container [2020-11-29 12:59:30,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:59:30" (3/3) ... [2020-11-29 12:59:30,290 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c [2020-11-29 12:59:30,312 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 12:59:30,315 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 12:59:30,333 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 12:59:30,364 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 12:59:30,364 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 12:59:30,365 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 12:59:30,365 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 12:59:30,365 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 12:59:30,365 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 12:59:30,366 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 12:59:30,366 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 12:59:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-29 12:59:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-29 12:59:30,388 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 12:59:30,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-29 12:59:30,389 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 12:59:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 12:59:30,397 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-29 12:59:30,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 12:59:30,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671918499] [2020-11-29 12:59:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 12:59:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 12:59:30,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 12:59:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 12:59:30,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 12:59:30,577 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 12:59:30,578 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 12:59:30,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 12:59:30,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:59:30 BoogieIcfgContainer [2020-11-29 12:59:30,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 12:59:30,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 12:59:30,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 12:59:30,608 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 12:59:30,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:59:30" (3/4) ... [2020-11-29 12:59:30,612 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 12:59:30,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 12:59:30,615 INFO L168 Benchmark]: Toolchain (without parser) took 998.67 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 20.1 MB in the beginning and 26.2 MB in the end (delta: -6.1 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-11-29 12:59:30,617 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 41.9 MB. Free memory was 22.4 MB in the beginning and 22.3 MB in the end (delta: 33.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:59:30,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.45 ms. Allocated memory is still 41.9 MB. Free memory was 19.4 MB in the beginning and 21.4 MB in the end (delta: -2.0 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-11-29 12:59:30,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 41.9 MB. Free memory was 21.3 MB in the beginning and 20.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:59:30,620 INFO L168 Benchmark]: Boogie Preprocessor took 21.43 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 19.0 MB in the end (delta: 912.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:59:30,621 INFO L168 Benchmark]: RCFGBuilder took 346.87 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 19.0 MB in the beginning and 26.9 MB in the end (delta: -7.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. [2020-11-29 12:59:30,625 INFO L168 Benchmark]: TraceAbstraction took 325.66 ms. Allocated memory is still 50.3 MB. Free memory was 26.6 MB in the beginning and 26.6 MB in the end (delta: -4.3 kB). Peak memory consumption was 635.6 kB. Max. memory is 16.1 GB. [2020-11-29 12:59:30,625 INFO L168 Benchmark]: Witness Printer took 5.37 ms. Allocated memory is still 50.3 MB. Free memory was 26.6 MB in the beginning and 26.2 MB in the end (delta: 383.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:59:30,634 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.40 ms. Allocated memory is still 41.9 MB. Free memory was 22.4 MB in the beginning and 22.3 MB in the end (delta: 33.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 249.45 ms. Allocated memory is still 41.9 MB. Free memory was 19.4 MB in the beginning and 21.4 MB in the end (delta: -2.0 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 41.9 MB. Free memory was 21.3 MB in the beginning and 20.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.43 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 19.0 MB in the end (delta: 912.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 346.87 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 19.0 MB in the beginning and 26.9 MB in the end (delta: -7.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 325.66 ms. Allocated memory is still 50.3 MB. Free memory was 26.6 MB in the beginning and 26.6 MB in the end (delta: -4.3 kB). Peak memory consumption was 635.6 kB. Max. memory is 16.1 GB. * Witness Printer took 5.37 ms. Allocated memory is still 50.3 MB. Free memory was 26.6 MB in the beginning and 26.2 MB in the end (delta: 383.3 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 / 2.5; 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.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-0e1a00c [2020-11-29 12:59:33,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 12:59:33,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 12:59:33,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 12:59:33,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 12:59:33,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 12:59:33,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 12:59:33,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 12:59:33,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 12:59:33,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 12:59:33,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 12:59:33,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 12:59:33,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 12:59:33,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 12:59:33,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 12:59:33,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 12:59:33,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 12:59:33,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 12:59:33,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 12:59:33,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 12:59:33,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 12:59:33,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 12:59:33,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 12:59:33,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 12:59:33,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 12:59:33,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 12:59:33,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 12:59:33,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 12:59:33,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 12:59:33,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 12:59:33,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 12:59:33,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 12:59:33,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 12:59:33,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 12:59:33,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 12:59:33,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 12:59:33,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 12:59:33,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 12:59:33,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 12:59:33,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 12:59:33,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 12:59:33,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-29 12:59:33,157 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 12:59:33,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 12:59:33,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 12:59:33,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 12:59:33,160 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 12:59:33,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 12:59:33,160 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 12:59:33,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 12:59:33,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 12:59:33,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 12:59:33,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 12:59:33,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 12:59:33,162 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-29 12:59:33,162 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-29 12:59:33,162 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 12:59:33,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 12:59:33,163 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 12:59:33,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 12:59:33,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 12:59:33,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 12:59:33,164 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 12:59:33,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 12:59:33,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 12:59:33,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 12:59:33,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 12:59:33,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 12:59:33,166 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-29 12:59:33,166 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-29 12:59:33,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 12:59:33,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 12:59:33,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-29 12:59:33,167 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 -> fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 [2020-11-29 12:59:33,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 12:59:33,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 12:59:33,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 12:59:33,604 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 12:59:33,604 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 12:59:33,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-11-29 12:59:33,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be3354ec/335e7b5b8d9146cea6580474ee6216fc/FLAG5feca2d44 [2020-11-29 12:59:34,191 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 12:59:34,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-11-29 12:59:34,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be3354ec/335e7b5b8d9146cea6580474ee6216fc/FLAG5feca2d44 [2020-11-29 12:59:34,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be3354ec/335e7b5b8d9146cea6580474ee6216fc [2020-11-29 12:59:34,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 12:59:34,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 12:59:34,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 12:59:34,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 12:59:34,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 12:59:34,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43eabb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34, skipping insertion in model container [2020-11-29 12:59:34,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 12:59:34,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 12:59:34,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 12:59:34,843 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 12:59:34,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 12:59:34,877 INFO L208 MainTranslator]: Completed translation [2020-11-29 12:59:34,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34 WrapperNode [2020-11-29 12:59:34,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 12:59:34,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 12:59:34,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 12:59:34,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 12:59:34,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 12:59:34,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 12:59:34,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 12:59:34,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 12:59:34,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (1/1) ... [2020-11-29 12:59:34,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 12:59:34,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 12:59:34,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 12:59:34,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 12:59:34,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (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-11-29 12:59:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 12:59:35,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 12:59:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-29 12:59:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 12:59:39,266 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 12:59:39,268 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-29 12:59:39,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:59:39 BoogieIcfgContainer [2020-11-29 12:59:39,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 12:59:39,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 12:59:39,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 12:59:39,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 12:59:39,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:59:34" (1/3) ... [2020-11-29 12:59:39,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c6ce43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:59:39, skipping insertion in model container [2020-11-29 12:59:39,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:34" (2/3) ... [2020-11-29 12:59:39,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c6ce43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:59:39, skipping insertion in model container [2020-11-29 12:59:39,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:59:39" (3/3) ... [2020-11-29 12:59:39,290 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c [2020-11-29 12:59:39,305 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 12:59:39,309 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 12:59:39,322 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 12:59:39,348 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 12:59:39,349 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 12:59:39,349 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 12:59:39,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 12:59:39,349 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 12:59:39,350 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 12:59:39,350 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 12:59:39,350 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 12:59:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-29 12:59:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-29 12:59:39,368 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 12:59:39,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-29 12:59:39,369 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 12:59:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 12:59:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-29 12:59:39,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 12:59:39,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759732233] [2020-11-29 12:59:39,388 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-11-29 12:59:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 12:59:39,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 12:59:39,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 12:59:44,119 WARN L197 SmtUtils]: Spent 3.91 s on a formula simplification that was a NOOP. DAG size: 11 [2020-11-29 12:59:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 12:59:44,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 12:59:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 12:59:46,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759732233] [2020-11-29 12:59:46,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 12:59:46,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-29 12:59:46,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788441140] [2020-11-29 12:59:46,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 12:59:46,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 12:59:46,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 12:59:46,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2020-11-29 12:59:46,319 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2020-11-29 12:59:51,952 WARN L197 SmtUtils]: Spent 3.23 s on a formula simplification that was a NOOP. DAG size: 13 [2020-11-29 13:00:02,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 13:00:02,869 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-11-29 13:00:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 13:00:02,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-11-29 13:00:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 13:00:02,885 INFO L225 Difference]: With dead ends: 18 [2020-11-29 13:00:02,885 INFO L226 Difference]: Without dead ends: 8 [2020-11-29 13:00:02,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=18, Invalid=21, Unknown=3, NotChecked=0, Total=42 [2020-11-29 13:00:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-29 13:00:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-29 13:00:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-29 13:00:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-11-29 13:00:02,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2020-11-29 13:00:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 13:00:02,916 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-11-29 13:00:02,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 13:00:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-11-29 13:00:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 13:00:02,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 13:00:02,918 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-11-29 13:00:03,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-29 13:00:03,123 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 13:00:03,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 13:00:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 1 times [2020-11-29 13:00:03,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 13:00:03,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59861534] [2020-11-29 13:00:03,126 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-11-29 13:00:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 13:00:03,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 13:00:03,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 13:00:05,881 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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-11-29 13:00:10,681 WARN L197 SmtUtils]: Spent 3.82 s on a formula simplification that was a NOOP. DAG size: 13 [2020-11-29 13:00:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-11-29 13:00:10,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 13:00:14,944 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 (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-11-29 13:00:17,050 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 (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-11-29 13:00:19,250 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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-11-29 13:00:21,454 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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-11-29 13:00:23,645 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2020-11-29 13:00:25,854 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2020-11-29 13:00:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-11-29 13:00:25,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59861534] [2020-11-29 13:00:25,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 13:00:25,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2020-11-29 13:00:25,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463323230] [2020-11-29 13:00:25,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 13:00:25,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 13:00:25,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 13:00:25,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=19, Unknown=8, NotChecked=44, Total=90 [2020-11-29 13:00:25,860 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2020-11-29 13:00:28,102 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2020-11-29 13:00:30,335 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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 c_ULTIMATE.start_main_~main__x1~0 .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from true [2020-11-29 13:00:32,435 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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 (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)))) is different from false [2020-11-29 13:00:34,537 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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 (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)))) is different from true [2020-11-29 13:00:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 13:00:42,647 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-11-29 13:00:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 13:00:42,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2020-11-29 13:00:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 13:00:42,649 INFO L225 Difference]: With dead ends: 13 [2020-11-29 13:00:42,649 INFO L226 Difference]: Without dead ends: 10 [2020-11-29 13:00:42,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=25, Invalid=21, Unknown=12, NotChecked=98, Total=156 [2020-11-29 13:00:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-11-29 13:00:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-11-29 13:00:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-29 13:00:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-11-29 13:00:42,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2020-11-29 13:00:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 13:00:42,654 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-11-29 13:00:42,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 13:00:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-11-29 13:00:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-29 13:00:42,655 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 13:00:42,655 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-11-29 13:00:42,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-29 13:00:42,857 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 13:00:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 13:00:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2020-11-29 13:00:42,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 13:00:42,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345284009] [2020-11-29 13:00:42,860 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-11-29 13:00:43,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 13:00:43,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 13:00:43,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 13:00:43,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 13:00:45,924 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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-11-29 13:00:48,994 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 (/ 5.0 2.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-11-29 13:00:52,076 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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-11-29 13:00:54,656 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= (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__x~0) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0)))) is different from true [2020-11-29 13:00:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-11-29 13:00:54,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 13:00:57,002 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x1~0))) is different from false [2020-11-29 13:00:59,104 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2020-11-29 13:01:01,329 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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-11-29 13:01:03,569 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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-11-29 13:01:05,915 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .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-11-29 13:01:08,250 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .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-11-29 13:01:10,686 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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))) (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-11-29 13:01:13,124 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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))) (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-11-29 13:01:15,574 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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))) (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-11-29 13:01:18,017 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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))) (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-11-29 13:01:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-11-29 13:01:18,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345284009] [2020-11-29 13:01:18,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 13:01:18,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2020-11-29 13:01:18,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494897070] [2020-11-29 13:01:18,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 13:01:18,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 13:01:18,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 13:01:18,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=24, Unknown=14, NotChecked=144, Total=210 [2020-11-29 13:01:18,022 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 15 states. [2020-11-29 13:01:20,526 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-29 13:01:22,962 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (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-11-29 13:01:25,406 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (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-11-29 13:01:27,743 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.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)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0) .cse0))) (or (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-29 13:01:29,977 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= 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)) (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-11-29 13:01:34,090 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (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) (= (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-11-29 13:01:36,683 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= (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__x~0) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0)) (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))))) is different from true [2020-11-29 13:01:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 13:01:43,247 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-11-29 13:01:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 13:01:43,249 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 9 [2020-11-29 13:01:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 13:01:43,249 INFO L225 Difference]: With dead ends: 14 [2020-11-29 13:01:43,249 INFO L226 Difference]: Without dead ends: 11 [2020-11-29 13:01:43,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=40, Invalid=29, Unknown=21, NotChecked=330, Total=420 [2020-11-29 13:01:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-11-29 13:01:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-11-29 13:01:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-11-29 13:01:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-11-29 13:01:43,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2020-11-29 13:01:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 13:01:43,255 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-11-29 13:01:43,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 13:01:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-11-29 13:01:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 13:01:43,256 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 13:01:43,256 INFO L422 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2020-11-29 13:01:43,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-29 13:01:43,467 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 13:01:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 13:01:43,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 3 times [2020-11-29 13:01:43,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 13:01:43,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970430218] [2020-11-29 13:01:43,470 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-11-29 13:01:44,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-29 13:01:44,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 13:01:44,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 13:01:44,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 13:01:46,639 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))))) is different from false [2020-11-29 13:01:48,730 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))))) is different from true [2020-11-29 13:01:50,977 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (exists ((v_ULTIMATE.start_main_~main__x~0_16 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_16 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))))) (and (= .cse0 c_ULTIMATE.start_main_~main__x~0) (not (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_16)))))) is different from false [2020-11-29 13:01:51,006 INFO L626 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 13:02:02,352 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_ULTIMATE.start_main_~main__x~0_16 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_16 .cse1))) (and (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_16)))))) (= (bvadd c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((v_ULTIMATE.start_main_~main__x~0_16 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_16 .cse3))) (and (not (fp.eq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.div roundNearestTiesToEven .cse2 .cse3) .cse2) (not (fp.eq .cse2 v_ULTIMATE.start_main_~main__x~0_16)))))) (= c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0 (_ bv0 32)))) is different from false [2020-11-29 13:02:09,023 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~main__x~0_16 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_16 .cse1))) (and (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_16)))))) is different from false [2020-11-29 13:02:11,182 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~main__x~0_16 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_16 .cse1))) (and (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_16)))))) is different from true [2020-11-29 13:02:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2020-11-29 13:02:11,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 13:02:13,573 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) is different from false [2020-11-29 13:02:15,681 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) is different from true [2020-11-29 13:02:17,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x~0_18 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_18 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_18) (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-11-29 13:02:20,054 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x~0_18 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_18 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_18) (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-11-29 13:02:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2020-11-29 13:02:20,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970430218] [2020-11-29 13:02:20,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 13:02:20,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-11-29 13:02:20,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79494137] [2020-11-29 13:02:20,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 13:02:20,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 13:02:20,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 13:02:20,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=15, Unknown=10, NotChecked=66, Total=110 [2020-11-29 13:02:20,085 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2020-11-29 13:02:22,267 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~main__x~0_18 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_18 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_18) (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-11-29 13:02:24,532 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~main__x~0_18 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_18 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_18) (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-11-29 13:02:26,744 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (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 c_ULTIMATE.start_main_~main__x~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0)) (forall ((v_ULTIMATE.start_main_~main__x~0_18 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_18 .cse2))) (or (fp.eq .cse1 v_ULTIMATE.start_main_~main__x~0_18) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))))) is different from false [2020-11-29 13:02:29,058 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (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 c_ULTIMATE.start_main_~main__x~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0)) (forall ((v_ULTIMATE.start_main_~main__x~0_18 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_18 .cse2))) (or (fp.eq .cse1 v_ULTIMATE.start_main_~main__x~0_18) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))))) is different from true [2020-11-29 13:02:31,385 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 .cse0) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) c_ULTIMATE.start_main_~main__x1~0)) .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1)) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 .cse0) (not .cse2)) (exists ((v_ULTIMATE.start_main_~main__x~0_16 (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_16 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))))) (and (= .cse3 c_ULTIMATE.start_main_~main__x~0) (not (fp.eq .cse3 v_ULTIMATE.start_main_~main__x~0_16))))) (forall ((v_ULTIMATE.start_main_~main__x~0_18 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_18 .cse5))) (or (fp.eq .cse4 v_ULTIMATE.start_main_~main__x~0_18) (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse5) .cse4)) (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))))) is different from false [2020-11-29 13:02:33,712 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 .cse0) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) c_ULTIMATE.start_main_~main__x1~0)) .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1)) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 .cse0) (not .cse2)) (exists ((v_ULTIMATE.start_main_~main__x~0_16 (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_16 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))))) (and (= .cse3 c_ULTIMATE.start_main_~main__x~0) (not (fp.eq .cse3 v_ULTIMATE.start_main_~main__x~0_16))))) (forall ((v_ULTIMATE.start_main_~main__x~0_18 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_18 .cse5))) (or (fp.eq .cse4 v_ULTIMATE.start_main_~main__x~0_18) (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse5) .cse4)) (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))))) is different from true [2020-11-29 13:02:35,882 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0 (_ bv0 32)))) (and (not .cse0) (or (and (exists ((v_ULTIMATE.start_main_~main__x~0_16 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_16 .cse2))) (and (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse2) .cse1) (not (fp.eq .cse1 v_ULTIMATE.start_main_~main__x~0_16)))))) (= (bvadd c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((v_ULTIMATE.start_main_~main__x~0_16 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_16 .cse4))) (and (not (fp.eq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse4) .cse3) (not (fp.eq .cse3 v_ULTIMATE.start_main_~main__x~0_16)))))) .cse0)))) is different from false [2020-11-29 13:02:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 13:02:35,898 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-11-29 13:02:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 13:02:35,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2020-11-29 13:02:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 13:02:35,898 INFO L225 Difference]: With dead ends: 11 [2020-11-29 13:02:35,898 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 13:02:35,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=27, Invalid=16, Unknown=17, NotChecked=150, Total=210 [2020-11-29 13:02:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 13:02:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 13:02:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 13:02:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 13:02:35,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2020-11-29 13:02:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 13:02:35,900 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 13:02:35,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 13:02:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 13:02:35,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 13:02:36,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-29 13:02:36,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-29 13:03:28,527 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-29 13:03:28,530 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.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:393) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.(HoareAnnotationComposer.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeCFGHoareAnnotation(BasicCegarLoop.java:1052) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) ... 34 more [2020-11-29 13:03:28,537 INFO L168 Benchmark]: Toolchain (without parser) took 233946.17 ms. Allocated memory is still 54.5 MB. Free memory was 31.4 MB in the beginning and 30.4 MB in the end (delta: 1.0 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2020-11-29 13:03:28,544 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 54.5 MB. Free memory was 35.4 MB in the beginning and 35.3 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 13:03:28,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.82 ms. Allocated memory is still 54.5 MB. Free memory was 30.7 MB in the beginning and 36.2 MB in the end (delta: -5.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 13:03:28,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.35 ms. Allocated memory is still 54.5 MB. Free memory was 36.2 MB in the beginning and 34.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 13:03:28,546 INFO L168 Benchmark]: Boogie Preprocessor took 27.18 ms. Allocated memory is still 54.5 MB. Free memory was 34.7 MB in the beginning and 33.5 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 13:03:28,547 INFO L168 Benchmark]: RCFGBuilder took 4329.90 ms. Allocated memory is still 54.5 MB. Free memory was 33.5 MB in the beginning and 22.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 13:03:28,548 INFO L168 Benchmark]: TraceAbstraction took 229253.59 ms. Allocated memory is still 54.5 MB. Free memory was 37.7 MB in the beginning and 30.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. [2020-11-29 13:03:28,554 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.25 ms. Allocated memory is still 54.5 MB. Free memory was 35.4 MB in the beginning and 35.3 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 279.82 ms. Allocated memory is still 54.5 MB. Free memory was 30.7 MB in the beginning and 36.2 MB in the end (delta: -5.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.35 ms. Allocated memory is still 54.5 MB. Free memory was 36.2 MB in the beginning and 34.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.18 ms. Allocated memory is still 54.5 MB. Free memory was 34.7 MB in the beginning and 33.5 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4329.90 ms. Allocated memory is still 54.5 MB. Free memory was 33.5 MB in the beginning and 22.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 229253.59 ms. Allocated memory is still 54.5 MB. Free memory was 37.7 MB in the beginning and 30.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.0 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...