./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a --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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 09:07:03,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:07:03,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:07:03,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:07:03,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:07:03,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:07:03,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:07:03,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:07:03,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:07:03,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:07:03,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:07:03,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:07:03,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:07:03,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:07:03,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:07:03,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:07:03,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:07:03,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:07:03,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:07:03,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:07:03,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:07:03,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:07:03,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:07:03,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:07:03,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:07:03,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:07:03,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:07:03,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:07:03,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:07:03,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:07:03,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:07:03,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:07:03,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:07:03,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:07:03,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:07:03,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:07:03,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:07:03,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:07:03,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:07:03,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:07:03,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:07:03,191 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 09:07:03,214 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:07:03,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:07:03,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:07:03,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:07:03,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:07:03,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:07:03,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:07:03,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:07:03,223 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:07:03,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:07:03,224 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:07:03,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 09:07:03,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:07:03,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:07:03,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 09:07:03,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:07:03,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 09:07:03,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:07:03,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 09:07:03,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:07:03,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 09:07:03,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:07:03,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:07:03,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:07:03,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:07:03,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:07:03,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:07:03,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 09:07:03,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 09:07:03,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 09:07:03,233 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 09:07:03,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 09:07:03,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 09:07:03,234 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-21 09:07:03,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:07:03,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:07:03,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:07:03,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:07:03,566 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:07:03,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-21 09:07:06,646 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:07:06,827 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:07:06,828 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/sv-benchmarks/c/float-benchs/filter1.c [2022-11-21 09:07:06,834 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/data/b3f9a5050/0123bb377f2d4f61b5e5c76269e5b5d9/FLAG43a6018c2 [2022-11-21 09:07:06,849 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/data/b3f9a5050/0123bb377f2d4f61b5e5c76269e5b5d9 [2022-11-21 09:07:06,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:07:06,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:07:06,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:07:06,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:07:06,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:07:06,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:07:06" (1/1) ... [2022-11-21 09:07:06,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0c64d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:06, skipping insertion in model container [2022-11-21 09:07:06,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:07:06" (1/1) ... [2022-11-21 09:07:06,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:07:06,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:07:07,045 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-21 09:07:07,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:07:07,081 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:07:07,096 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-21 09:07:07,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:07:07,122 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:07:07,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07 WrapperNode [2022-11-21 09:07:07,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:07:07,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:07:07,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:07:07,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:07:07,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,168 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-21 09:07:07,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:07:07,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:07:07,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:07:07,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:07:07,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,210 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:07:07,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:07:07,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:07:07,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:07:07,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (1/1) ... [2022-11-21 09:07:07,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:07:07,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:07:07,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:07:07,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:07:07,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:07:07,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 09:07:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:07:07,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:07:07,403 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:07:07,406 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:07:07,594 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:07:07,601 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:07:07,601 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 09:07:07,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:07:07 BoogieIcfgContainer [2022-11-21 09:07:07,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:07:07,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:07:07,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:07:07,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:07:07,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:07:06" (1/3) ... [2022-11-21 09:07:07,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190db1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:07:07, skipping insertion in model container [2022-11-21 09:07:07,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:07" (2/3) ... [2022-11-21 09:07:07,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190db1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:07:07, skipping insertion in model container [2022-11-21 09:07:07,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:07:07" (3/3) ... [2022-11-21 09:07:07,613 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-21 09:07:07,632 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:07:07,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 09:07:07,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:07:07,698 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e7dabc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:07:07,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 09:07:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 09:07:07,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:07:07,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:07:07,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:07:07,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:07:07,718 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-11-21 09:07:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:07:07,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139160774] [2022-11-21 09:07:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:07:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:07:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:07:07,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139160774] [2022-11-21 09:07:07,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139160774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:07:07,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:07:07,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:07:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988985180] [2022-11-21 09:07:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:07:07,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 09:07:07,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:07:07,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 09:07:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 09:07:07,917 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:07:07,933 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-21 09:07:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 09:07:07,936 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 09:07:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:07:07,944 INFO L225 Difference]: With dead ends: 30 [2022-11-21 09:07:07,944 INFO L226 Difference]: Without dead ends: 12 [2022-11-21 09:07:07,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 09:07:07,956 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:07:07,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:07:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-21 09:07:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-21 09:07:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-21 09:07:08,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-21 09:07:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:07:08,010 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-21 09:07:08,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-21 09:07:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 09:07:08,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:07:08,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:07:08,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 09:07:08,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:07:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:07:08,013 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-11-21 09:07:08,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:07:08,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345161169] [2022-11-21 09:07:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:07:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 09:07:08,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 09:07:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 09:07:08,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 09:07:08,082 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 09:07:08,084 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 09:07:08,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 09:07:08,090 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-21 09:07:08,094 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 09:07:08,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:07:08 BoogieIcfgContainer [2022-11-21 09:07:08,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 09:07:08,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 09:07:08,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 09:07:08,117 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 09:07:08,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:07:07" (3/4) ... [2022-11-21 09:07:08,121 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 09:07:08,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 09:07:08,122 INFO L158 Benchmark]: Toolchain (without parser) took 1268.09ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 89.0MB in the beginning and 131.5MB in the end (delta: -42.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:07:08,122 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory was 97.5MB in the beginning and 97.5MB in the end (delta: 55.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:07:08,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.53ms. Allocated memory is still 125.8MB. Free memory was 89.0MB in the beginning and 78.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 09:07:08,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.32ms. Allocated memory is still 125.8MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 09:07:08,140 INFO L158 Benchmark]: Boogie Preprocessor took 43.62ms. Allocated memory is still 125.8MB. Free memory was 77.2MB in the beginning and 76.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:07:08,141 INFO L158 Benchmark]: RCFGBuilder took 390.02ms. Allocated memory is still 125.8MB. Free memory was 76.0MB in the beginning and 66.3MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 09:07:08,142 INFO L158 Benchmark]: TraceAbstraction took 510.06ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 65.5MB in the beginning and 132.4MB in the end (delta: -66.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:07:08,142 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 163.6MB. Free memory was 132.4MB in the beginning and 131.5MB in the end (delta: 868.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 09:07:08,146 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.32ms. Allocated memory is still 125.8MB. Free memory was 97.5MB in the beginning and 97.5MB in the end (delta: 55.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.53ms. Allocated memory is still 125.8MB. Free memory was 89.0MB in the beginning and 78.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.32ms. Allocated memory is still 125.8MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.62ms. Allocated memory is still 125.8MB. Free memory was 77.2MB in the beginning and 76.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 390.02ms. Allocated memory is still 125.8MB. Free memory was 76.0MB in the beginning and 66.3MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 510.06ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 65.5MB in the beginning and 132.4MB in the end (delta: -66.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 163.6MB. Free memory was 132.4MB in the beginning and 131.5MB in the end (delta: 868.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of to_real at line 34. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 VAL [i=0] [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 VAL [E0=53, i=0] [L39] E1 = E0 [L41] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 [2022-11-21 09:07:08,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a --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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 09:07:10,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:07:10,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:07:10,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:07:10,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:07:10,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:07:10,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:07:10,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:07:10,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:07:10,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:07:10,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:07:10,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:07:10,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:07:10,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:07:10,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:07:10,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:07:10,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:07:10,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:07:10,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:07:10,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:07:10,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:07:10,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:07:10,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:07:10,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:07:10,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:07:10,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:07:10,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:07:10,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:07:10,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:07:10,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:07:10,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:07:10,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:07:10,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:07:10,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:07:10,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:07:10,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:07:10,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:07:10,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:07:10,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:07:10,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:07:10,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:07:10,825 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-21 09:07:10,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:07:10,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:07:10,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:07:10,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:07:10,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:07:10,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:07:10,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:07:10,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:07:10,856 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:07:10,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:07:10,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:07:10,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:07:10,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:07:10,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 09:07:10,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:07:10,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 09:07:10,858 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 09:07:10,858 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 09:07:10,858 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 09:07:10,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:07:10,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 09:07:10,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:07:10,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 09:07:10,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:07:10,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:07:10,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:07:10,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:07:10,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:07:10,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:07:10,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 09:07:10,861 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 09:07:10,861 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 09:07:10,862 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 09:07:10,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 09:07:10,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 09:07:10,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 09:07:10,863 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-21 09:07:11,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:07:11,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:07:11,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:07:11,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:07:11,299 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:07:11,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-21 09:07:14,411 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:07:14,697 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:07:14,698 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/sv-benchmarks/c/float-benchs/filter1.c [2022-11-21 09:07:14,704 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/data/ec38d9f58/e4bae31a3c824124a9e5f595461230a9/FLAGc1bd3c30b [2022-11-21 09:07:14,718 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/data/ec38d9f58/e4bae31a3c824124a9e5f595461230a9 [2022-11-21 09:07:14,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:07:14,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:07:14,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:07:14,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:07:14,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:07:14,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:07:14" (1/1) ... [2022-11-21 09:07:14,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18acd032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:14, skipping insertion in model container [2022-11-21 09:07:14,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:07:14" (1/1) ... [2022-11-21 09:07:14,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:07:14,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:07:14,917 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-21 09:07:14,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:07:14,961 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:07:14,977 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-21 09:07:14,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:07:15,000 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:07:15,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15 WrapperNode [2022-11-21 09:07:15,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:07:15,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:07:15,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:07:15,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:07:15,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,040 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-21 09:07:15,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:07:15,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:07:15,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:07:15,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:07:15,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,084 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:07:15,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:07:15,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:07:15,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:07:15,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (1/1) ... [2022-11-21 09:07:15,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:07:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:07:15,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:07:15,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:07:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:07:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 09:07:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:07:15,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:07:15,303 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:07:15,305 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:07:17,565 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:07:17,581 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:07:17,582 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 09:07:17,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:07:17 BoogieIcfgContainer [2022-11-21 09:07:17,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:07:17,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:07:17,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:07:17,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:07:17,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:07:14" (1/3) ... [2022-11-21 09:07:17,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423365db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:07:17, skipping insertion in model container [2022-11-21 09:07:17,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:07:15" (2/3) ... [2022-11-21 09:07:17,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423365db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:07:17, skipping insertion in model container [2022-11-21 09:07:17,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:07:17" (3/3) ... [2022-11-21 09:07:17,602 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-21 09:07:17,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:07:17,653 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 09:07:17,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:07:17,747 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ed97fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:07:17,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 09:07:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:17,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 09:07:17,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:07:17,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:07:17,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:07:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:07:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-11-21 09:07:17,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:07:17,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112250301] [2022-11-21 09:07:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:17,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 09:07:17,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:07:17,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 09:07:17,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-21 09:07:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:17,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 09:07:17,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:07:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:07:17,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:07:17,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:07:17,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112250301] [2022-11-21 09:07:17,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112250301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:07:17,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:07:17,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:07:17,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702330147] [2022-11-21 09:07:17,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:07:17,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 09:07:17,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:07:18,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 09:07:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 09:07:18,034 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:07:18,053 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-21 09:07:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 09:07:18,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 09:07:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:07:18,065 INFO L225 Difference]: With dead ends: 30 [2022-11-21 09:07:18,065 INFO L226 Difference]: Without dead ends: 12 [2022-11-21 09:07:18,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 09:07:18,073 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:07:18,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:07:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-21 09:07:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-21 09:07:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-21 09:07:18,113 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-21 09:07:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:07:18,114 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-21 09:07:18,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-21 09:07:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 09:07:18,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:07:18,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:07:18,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-21 09:07:18,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 09:07:18,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:07:18,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:07:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-11-21 09:07:18,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:07:18,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024907540] [2022-11-21 09:07:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:18,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 09:07:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:07:18,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 09:07:18,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-21 09:07:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:18,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 09:07:18,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:07:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:07:18,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:07:18,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:07:18,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024907540] [2022-11-21 09:07:18,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024907540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:07:18,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:07:18,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 09:07:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373285585] [2022-11-21 09:07:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:07:18,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:07:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:07:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:07:18,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:07:18,674 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:07:20,554 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-21 09:07:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:07:20,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 09:07:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:07:20,556 INFO L225 Difference]: With dead ends: 28 [2022-11-21 09:07:20,556 INFO L226 Difference]: Without dead ends: 26 [2022-11-21 09:07:20,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:07:20,558 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-21 09:07:20,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-21 09:07:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-21 09:07:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2022-11-21 09:07:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-21 09:07:20,564 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-11-21 09:07:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:07:20,565 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-21 09:07:20,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-21 09:07:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 09:07:20,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:07:20,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:07:20,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-21 09:07:20,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 09:07:20,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:07:20,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:07:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash -274941459, now seen corresponding path program 1 times [2022-11-21 09:07:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:07:20,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365837676] [2022-11-21 09:07:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:20,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 09:07:20,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:07:20,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 09:07:20,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-21 09:07:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:21,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 09:07:21,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:07:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:07:22,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:07:22,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:07:22,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365837676] [2022-11-21 09:07:22,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365837676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:07:22,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:07:22,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 09:07:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918260285] [2022-11-21 09:07:22,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:07:22,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 09:07:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:07:22,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 09:07:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 09:07:22,502 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:26,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-21 09:07:28,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 09:07:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:07:28,901 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-21 09:07:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 09:07:28,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 09:07:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:07:28,903 INFO L225 Difference]: With dead ends: 31 [2022-11-21 09:07:28,903 INFO L226 Difference]: Without dead ends: 29 [2022-11-21 09:07:28,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:07:28,905 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:07:28,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 35 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-11-21 09:07:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-21 09:07:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2022-11-21 09:07:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-21 09:07:28,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2022-11-21 09:07:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:07:28,910 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-21 09:07:28,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-21 09:07:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 09:07:28,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:07:28,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:07:28,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-21 09:07:29,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 09:07:29,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:07:29,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:07:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1443795685, now seen corresponding path program 1 times [2022-11-21 09:07:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:07:29,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545928669] [2022-11-21 09:07:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:29,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 09:07:29,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:07:29,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 09:07:29,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-21 09:07:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:29,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 09:07:29,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:08:26,100 WARN L233 SmtUtils]: Spent 9.85s on a formula simplification. DAG size of input: 28 DAG size of output: 3 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:08:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:08:26,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:08:38,687 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-21 09:08:40,732 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-21 09:09:02,751 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-11-21 09:09:04,798 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-21 09:09:31,812 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1))))))) is different from true [2022-11-21 09:11:14,139 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3)))))) is different from true [2022-11-21 09:12:08,024 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:12:26,064 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse1 (fp.neg .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)))))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) (fp.neg .cse3)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1))))))) is different from false [2022-11-21 09:12:28,085 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse1 (fp.neg .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)))))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) (fp.neg .cse3)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1))))))) is different from true [2022-11-21 09:12:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-21 09:12:37,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:12:37,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545928669] [2022-11-21 09:12:37,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545928669] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:12:37,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 09:12:37,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-11-21 09:12:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253754821] [2022-11-21 09:12:37,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 09:12:37,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 09:12:37,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:12:37,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 09:12:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=148, Unknown=25, NotChecked=150, Total=380 [2022-11-21 09:12:37,033 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:12:38,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:12:40,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 09:12:41,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:12:43,997 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse1 (fp.neg .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)))))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) (fp.neg .cse3)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-21 09:13:19,035 WARN L233 SmtUtils]: Spent 29.96s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:20,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:22,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:24,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:13:26,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:28,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:30,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:32,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:33,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:59,247 WARN L233 SmtUtils]: Spent 18.62s on a formula simplification. DAG size of input: 41 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:14:01,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:14:03,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:14:07,922 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse1)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse1)) (.cse5 (fp.mul c_currentRoundingMode .cse9 .cse0)) (.cse4 (fp.neg .cse6)) (.cse8 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse2)) (.cse3 (fp.mul c_currentRoundingMode .cse9 |c_ULTIMATE.start_main_~S~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) .cse7 (or (and .cse7 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse8) (and (or (not .cse8) (not .cse7)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4))) .cse8 (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-11-21 09:14:10,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:13,340 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-21 09:14:16,023 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-21 09:14:18,752 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 (fp.neg .cse4))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) .cse2) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (let ((.cse6 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse3)) (.cse5 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4))) (or (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6) (and (or (not .cse6) (not .cse5)) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-21 09:14:21,690 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse3) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse0) (fp.leq .cse1 .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-21 09:14:23,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:39,877 WARN L233 SmtUtils]: Spent 11.15s on a formula simplification. DAG size of input: 29 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:14:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:14:39,906 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-21 09:14:39,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 09:14:39,906 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 09:14:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:14:39,907 INFO L225 Difference]: With dead ends: 30 [2022-11-21 09:14:39,907 INFO L226 Difference]: Without dead ends: 28 [2022-11-21 09:14:39,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 188.6s TimeCoverageRelationStatistics Valid=88, Invalid=229, Unknown=33, NotChecked=462, Total=812 [2022-11-21 09:14:39,909 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 29.7s IncrementalHoareTripleChecker+Time [2022-11-21 09:14:39,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 6 Unknown, 80 Unchecked, 29.7s Time] [2022-11-21 09:14:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-21 09:14:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-21 09:14:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:14:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-21 09:14:39,915 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2022-11-21 09:14:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:14:39,915 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-21 09:14:39,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:14:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-21 09:14:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 09:14:39,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:14:39,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:14:39,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-21 09:14:40,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 09:14:40,123 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:14:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:14:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1185630247, now seen corresponding path program 1 times [2022-11-21 09:14:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:14:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861987102] [2022-11-21 09:14:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:14:40,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 09:14:40,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:14:40,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 09:14:40,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_893d5fc8-6ab3-4280-ac82-b791f94d10b5/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-21 09:14:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:14:41,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 09:14:41,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:15:11,373 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse1 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) |ULTIMATE.start_main_~E1~0#1|) .cse2)))) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-21 09:16:54,030 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse5 (fp.neg .cse6)) (.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4))) (or (and (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse6)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|))) (and (fp.leq .cse7 .cse6) (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq .cse7 .cse5) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2022-11-21 09:17:25,340 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse5))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))))) is different from false [2022-11-21 09:17:27,370 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse5))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))))) is different from true [2022-11-21 09:17:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 09:17:27,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:17:38,065 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-21 09:17:40,124 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-21 09:18:03,247 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-11-21 09:18:05,310 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-21 09:18:32,618 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3))))))) is different from true [2022-11-21 09:19:49,951 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from true [2022-11-21 09:20:16,463 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse4))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse0 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3))))))) (not (fp.geq |c_ULTIMATE.start_main_~S~0#1| .cse2)) (not (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse4))))) is different from true [2022-11-21 09:20:53,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse2)) (.cse6 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4)))))) (not (fp.geq .cse6 .cse4)) (not (fp.leq .cse6 .cse2))))) is different from false [2022-11-21 09:20:55,516 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse2)) (.cse6 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4)))))) (not (fp.geq .cse6 .cse4)) (not (fp.leq .cse6 .cse2))))) is different from true [2022-11-21 09:22:11,127 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse2)) (.cse6 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4)))))) (not (fp.geq .cse6 .cse4)) (not (fp.leq .cse6 .cse2)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from false [2022-11-21 09:22:13,244 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse2)) (.cse6 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4)))))) (not (fp.geq .cse6 .cse4)) (not (fp.leq .cse6 .cse2)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from true