./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- 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-5e519f3 [2022-11-03 02:26:43,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:26:43,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:26:43,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:26:43,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:26:43,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:26:43,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:26:43,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:26:43,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:26:43,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:26:43,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:26:43,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:26:43,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:26:43,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:26:43,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:26:43,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:26:43,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:26:43,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:26:43,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:26:43,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:26:43,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:26:43,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:26:43,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:26:43,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:26:43,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:26:43,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:26:43,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:26:43,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:26:43,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:26:43,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:26:43,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:26:43,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:26:43,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:26:43,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:26:43,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:26:43,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:26:43,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:26:43,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:26:43,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:26:43,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:26:43,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:26:43,222 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:26:43,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:26:43,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:26:43,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:26:43,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:26:43,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:26:43,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:26:43,249 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:26:43,249 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:26:43,249 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:26:43,250 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:26:43,250 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:26:43,250 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:26:43,250 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:26:43,251 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:26:43,251 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:26:43,251 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:26:43,252 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:26:43,266 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:26:43,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:26:43,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:26:43,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:26:43,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:26:43,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:26:43,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:26:43,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:26:43,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:26:43,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:26:43,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:26:43,269 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:26:43,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:26:43,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:26:43,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:26:43,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:26:43,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:26:43,271 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:26:43,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:26:43,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:26:43,272 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:26:43,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:26:43,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:26:43,275 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:26:43,275 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_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/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_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2022-11-03 02:26:43,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:26:43,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:26:43,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:26:43,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:26:43,626 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:26:43,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-11-03 02:26:43,705 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data/6602770e9/eb8acbf0ce484ff9af9426ab3ba47959/FLAGfd3d42420 [2022-11-03 02:26:44,123 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:26:44,124 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-11-03 02:26:44,129 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data/6602770e9/eb8acbf0ce484ff9af9426ab3ba47959/FLAGfd3d42420 [2022-11-03 02:26:44,526 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data/6602770e9/eb8acbf0ce484ff9af9426ab3ba47959 [2022-11-03 02:26:44,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:26:44,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:26:44,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:26:44,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:26:44,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:26:44,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4cbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44, skipping insertion in model container [2022-11-03 02:26:44,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:26:44,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:26:44,706 WARN L230 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_648ad230-45db-4a8c-a80d-60570f18ca0e/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2022-11-03 02:26:44,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:26:44,719 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:26:44,743 WARN L230 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_648ad230-45db-4a8c-a80d-60570f18ca0e/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2022-11-03 02:26:44,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:26:44,762 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:26:44,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44 WrapperNode [2022-11-03 02:26:44,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:26:44,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:26:44,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:26:44,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:26:44,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,835 INFO L138 Inliner]: procedures = 18, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2022-11-03 02:26:44,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:26:44,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:26:44,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:26:44,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:26:44,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,874 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:26:44,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:26:44,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:26:44,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:26:44,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (1/1) ... [2022-11-03 02:26:44,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:26:44,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:26:44,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:26:44,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:26:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:26:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:26:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:26:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-03 02:26:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:26:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:26:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-11-03 02:26:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:26:45,080 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:26:45,083 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:26:45,232 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:26:45,253 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:26:45,263 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:26:45,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:26:45 BoogieIcfgContainer [2022-11-03 02:26:45,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:26:45,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:26:45,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:26:45,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:26:45,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:26:44" (1/3) ... [2022-11-03 02:26:45,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7162d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:26:45, skipping insertion in model container [2022-11-03 02:26:45,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:44" (2/3) ... [2022-11-03 02:26:45,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7162d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:26:45, skipping insertion in model container [2022-11-03 02:26:45,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:26:45" (3/3) ... [2022-11-03 02:26:45,277 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2022-11-03 02:26:45,296 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:26:45,296 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:26:45,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:26:45,348 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=FINITE_AUTOMATA, 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;@58e0f1aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:26:45,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:26:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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-03 02:26:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:26:45,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:45,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:26:45,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:26:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1338621212, now seen corresponding path program 1 times [2022-11-03 02:26:45,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:26:45,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883404829] [2022-11-03 02:26:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:26:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:45,641 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-03 02:26:45,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:26:45,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883404829] [2022-11-03 02:26:45,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883404829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:26:45,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:26:45,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:26:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85590398] [2022-11-03 02:26:45,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:26:45,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:26:45,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:26:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:26:45,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:26:45,743 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-03 02:26:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:26:45,904 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-11-03 02:26:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:26:45,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-11-03 02:26:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:26:45,914 INFO L225 Difference]: With dead ends: 44 [2022-11-03 02:26:45,915 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 02:26:45,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:26:45,921 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:26:45,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:26:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 02:26:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2022-11-03 02:26:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-03 02:26:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-11-03 02:26:45,952 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11 [2022-11-03 02:26:45,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:26:45,953 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-11-03 02:26:45,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-03 02:26:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-11-03 02:26:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:26:45,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:45,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:26:45,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:26:45,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:26:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1321610551, now seen corresponding path program 1 times [2022-11-03 02:26:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:26:45,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105066482] [2022-11-03 02:26:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:45,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:26:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:46,102 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-03 02:26:46,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:26:46,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105066482] [2022-11-03 02:26:46,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105066482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:26:46,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:26:46,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:26:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710547979] [2022-11-03 02:26:46,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:26:46,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:26:46,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:26:46,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:26:46,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:26:46,106 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03 02:26:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:26:46,121 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-11-03 02:26:46,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:26:46,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-11-03 02:26:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:26:46,123 INFO L225 Difference]: With dead ends: 33 [2022-11-03 02:26:46,123 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:26:46,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:26:46,125 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:26:46,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:26:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:26:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2022-11-03 02:26:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) 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-03 02:26:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-11-03 02:26:46,130 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2022-11-03 02:26:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:26:46,130 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-03 02:26:46,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03 02:26:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-11-03 02:26:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:26:46,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:46,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:26:46,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:26:46,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:26:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1139004290, now seen corresponding path program 1 times [2022-11-03 02:26:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:26:46,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241126780] [2022-11-03 02:26:46,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:26:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:26:46,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:26:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:26:46,181 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:26:46,181 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:26:46,182 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:26:46,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:26:46,188 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-03 02:26:46,192 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:26:46,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:26:46 BoogieIcfgContainer [2022-11-03 02:26:46,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:26:46,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:26:46,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:26:46,221 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:26:46,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:26:45" (3/4) ... [2022-11-03 02:26:46,224 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 02:26:46,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:26:46,225 INFO L158 Benchmark]: Toolchain (without parser) took 1695.49ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 47.5MB in the beginning and 56.4MB in the end (delta: -8.9MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-11-03 02:26:46,226 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 86.0MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:26:46,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.56ms. Allocated memory is still 86.0MB. Free memory was 47.2MB in the beginning and 36.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:26:46,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.55ms. Allocated memory is still 86.0MB. Free memory was 36.8MB in the beginning and 35.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:26:46,228 INFO L158 Benchmark]: Boogie Preprocessor took 41.03ms. Allocated memory is still 86.0MB. Free memory was 35.0MB in the beginning and 33.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:26:46,228 INFO L158 Benchmark]: RCFGBuilder took 389.14ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 33.8MB in the beginning and 74.8MB in the end (delta: -41.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-11-03 02:26:46,229 INFO L158 Benchmark]: TraceAbstraction took 950.06ms. Allocated memory is still 104.9MB. Free memory was 73.9MB in the beginning and 56.4MB in the end (delta: 17.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-11-03 02:26:46,229 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 104.9MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:26:46,232 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.22ms. Allocated memory is still 86.0MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.56ms. Allocated memory is still 86.0MB. Free memory was 47.2MB in the beginning and 36.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.55ms. Allocated memory is still 86.0MB. Free memory was 36.8MB in the beginning and 35.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.03ms. Allocated memory is still 86.0MB. Free memory was 35.0MB in the beginning and 33.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 389.14ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 33.8MB in the beginning and 74.8MB in the end (delta: -41.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 950.06ms. Allocated memory is still 104.9MB. Free memory was 73.9MB in the beginning and 56.4MB in the end (delta: 17.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 104.9MB. Free memory is still 56.4MB. There was no memory consumed. 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: 51]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] main__t = __VERIFIER_nondet_float() [L20] int main____CPAchecker_TMP_0; [L21] EXPR main__min[0] VAL [__return_main=0, main__max={4:0}, main__min={5:0}, main__min[0]=56] [L21] COND TRUE main__t >= (main__min[0]) [L23] EXPR main__max[4UL] VAL [__return_main=0, main__max={4:0}, main__max[4UL]=57, main__min={5:0}] [L23] COND TRUE main__t <= (main__max[4UL]) [L25] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__max={4:0}, main__min={5:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__max[main__i]=55, main__min={5:0}] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L63] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L51] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 34 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-03 02:26:46,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/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_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- 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-5e519f3 [2022-11-03 02:26:48,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:26:48,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:26:48,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:26:48,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:26:48,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:26:48,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:26:48,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:26:48,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:26:48,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:26:48,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:26:48,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:26:48,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:26:48,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:26:48,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:26:48,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:26:48,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:26:48,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:26:48,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:26:48,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:26:48,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:26:48,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:26:48,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:26:48,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:26:48,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:26:48,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:26:48,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:26:48,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:26:48,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:26:48,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:26:48,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:26:48,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:26:48,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:26:48,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:26:48,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:26:48,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:26:48,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:26:48,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:26:48,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:26:48,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:26:48,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:26:48,783 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 02:26:48,823 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:26:48,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:26:48,825 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:26:48,825 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:26:48,827 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:26:48,827 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:26:48,827 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:26:48,827 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:26:48,828 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:26:48,828 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:26:48,829 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:26:48,829 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:26:48,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:26:48,831 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:26:48,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:26:48,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:26:48,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:26:48,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:26:48,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:26:48,832 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:26:48,833 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:26:48,833 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:26:48,833 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:26:48,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:26:48,833 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:26:48,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:26:48,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:26:48,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:26:48,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:26:48,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:26:48,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:26:48,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:26:48,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:26:48,836 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:26:48,836 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:26:48,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:26:48,836 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:26:48,837 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:26:48,837 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_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/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_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2022-11-03 02:26:49,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:26:49,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:26:49,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:26:49,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:26:49,286 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:26:49,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-11-03 02:26:49,357 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data/f58741990/46028e7c41674bdf8e9e9e39ce1dd6d4/FLAGd219c3de5 [2022-11-03 02:26:49,932 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:26:49,932 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-11-03 02:26:49,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data/f58741990/46028e7c41674bdf8e9e9e39ce1dd6d4/FLAGd219c3de5 [2022-11-03 02:26:50,371 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/data/f58741990/46028e7c41674bdf8e9e9e39ce1dd6d4 [2022-11-03 02:26:50,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:26:50,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:26:50,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:26:50,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:26:50,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:26:50,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f134bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50, skipping insertion in model container [2022-11-03 02:26:50,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:26:50,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:26:50,606 WARN L230 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_648ad230-45db-4a8c-a80d-60570f18ca0e/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2022-11-03 02:26:50,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:26:50,621 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:26:50,644 WARN L230 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_648ad230-45db-4a8c-a80d-60570f18ca0e/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2022-11-03 02:26:50,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:26:50,662 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:26:50,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50 WrapperNode [2022-11-03 02:26:50,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:26:50,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:26:50,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:26:50,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:26:50,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,700 INFO L138 Inliner]: procedures = 19, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 100 [2022-11-03 02:26:50,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:26:50,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:26:50,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:26:50,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:26:50,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,727 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:26:50,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:26:50,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:26:50,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:26:50,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:26:50,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:26:50,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:26:50,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:26:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:26:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-11-03 02:26:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:26:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:26:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-11-03 02:26:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:26:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:26:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:26:50,882 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:26:50,884 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:26:51,810 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:26:51,817 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:26:51,817 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:26:51,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:26:51 BoogieIcfgContainer [2022-11-03 02:26:51,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:26:51,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:26:51,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:26:51,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:26:51,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:26:50" (1/3) ... [2022-11-03 02:26:51,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61329784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:26:51, skipping insertion in model container [2022-11-03 02:26:51,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (2/3) ... [2022-11-03 02:26:51,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61329784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:26:51, skipping insertion in model container [2022-11-03 02:26:51,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:26:51" (3/3) ... [2022-11-03 02:26:51,835 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2022-11-03 02:26:51,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:26:51,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:26:51,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:26:51,926 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=FINITE_AUTOMATA, 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;@1ea244cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:26:51,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:26:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-03 02:26:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:26:51,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:51,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:26:51,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:26:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2022-11-03 02:26:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:26:51,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579792621] [2022-11-03 02:26:51,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:51,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:26:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:26:51,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:26:51,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:26:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:52,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:26:52,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:26:52,433 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-03 02:26:52,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:26:52,434 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:26:52,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579792621] [2022-11-03 02:26:52,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579792621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:26:52,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:26:52,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:26:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738735809] [2022-11-03 02:26:52,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:26:52,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:26:52,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:26:52,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:26:52,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:26:52,475 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03 02:26:54,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:26:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:26:54,712 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-11-03 02:26:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:26:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-11-03 02:26:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:26:54,724 INFO L225 Difference]: With dead ends: 33 [2022-11-03 02:26:54,724 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 02:26:54,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:26:54,729 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:26:54,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 02:26:54,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 02:26:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-03 02:26:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-03 02:26:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-11-03 02:26:54,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2022-11-03 02:26:54,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:26:54,762 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-11-03 02:26:54,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03 02:26:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-11-03 02:26:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:26:54,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:54,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:26:54,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-03 02:26:54,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:26:54,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:26:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2022-11-03 02:26:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:26:54,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799824966] [2022-11-03 02:26:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:54,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:26:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:26:54,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:26:54,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:26:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:55,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:26:55,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:26:55,500 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-03 02:26:55,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:26:55,504 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:26:55,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799824966] [2022-11-03 02:26:55,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799824966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:26:55,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:26:55,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:26:55,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832128731] [2022-11-03 02:26:55,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:26:55,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:26:55,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:26:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:26:55,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:26:55,514 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-03 02:26:57,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:26:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:26:57,711 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-11-03 02:26:57,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:26:57,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Word has length 13 [2022-11-03 02:26:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:26:57,712 INFO L225 Difference]: With dead ends: 21 [2022-11-03 02:26:57,712 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 02:26:57,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:26:57,714 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:26:57,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 02:26:57,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 02:26:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 02:26:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-03 02:26:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-03 02:26:57,720 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2022-11-03 02:26:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:26:57,720 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-03 02:26:57,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-03 02:26:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-03 02:26:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:26:57,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:57,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:26:57,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:26:57,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:26:57,943 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:26:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2022-11-03 02:26:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:26:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591998344] [2022-11-03 02:26:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:26:57,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:26:57,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:26:57,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:26:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:58,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 02:26:58,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:27:00,617 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:27:00,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2022-11-03 02:27:41,066 WARN L234 SmtUtils]: Spent 17.50s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:28:04,345 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2022-11-03 02:28:06,381 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2022-11-03 02:28:29,038 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2022-11-03 02:28:31,065 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2022-11-03 02:29:03,407 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-03 02:29:03,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:03,407 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:29:03,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591998344] [2022-11-03 02:29:03,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591998344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:03,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:03,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:29:03,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666073904] [2022-11-03 02:29:03,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:03,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:29:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:29:03,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:29:03,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=59, Unknown=6, NotChecked=34, Total=132 [2022-11-03 02:29:03,409 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second 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-03 02:29:04,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:29:35,240 WARN L234 SmtUtils]: Spent 22.97s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:29:37,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:29:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:37,572 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-11-03 02:29:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:29:37,578 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 13 [2022-11-03 02:29:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:37,579 INFO L225 Difference]: With dead ends: 30 [2022-11-03 02:29:37,579 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:29:37,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 73.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=8, NotChecked=38, Total=156 [2022-11-03 02:29:37,580 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:37,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 26 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 1 Unknown, 60 Unchecked, 3.8s Time] [2022-11-03 02:29:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:29:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-11-03 02:29:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-03 02:29:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-11-03 02:29:37,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2022-11-03 02:29:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:37,588 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-11-03 02:29:37,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-03 02:29:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-11-03 02:29:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:29:37,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:37,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:37,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:37,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:29:37,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2022-11-03 02:29:37,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:29:37,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883422288] [2022-11-03 02:29:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:37,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:29:37,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:29:37,812 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:29:37,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:29:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:38,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:29:38,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:38,175 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-03 02:29:38,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:38,175 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:29:38,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883422288] [2022-11-03 02:29:38,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883422288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:38,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:38,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:29:38,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007754564] [2022-11-03 02:29:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:38,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:29:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:38,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:29:38,178 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03 02:29:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:38,216 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-11-03 02:29:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:38,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Word has length 13 [2022-11-03 02:29:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:38,219 INFO L225 Difference]: With dead ends: 32 [2022-11-03 02:29:38,219 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 02:29:38,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:29:38,221 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:38,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:29:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 02:29:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-03 02:29:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-03 02:29:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-03 02:29:38,232 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-11-03 02:29:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:38,233 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-03 02:29:38,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03 02:29:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-03 02:29:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:29:38,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:38,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:38,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:38,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:29:38,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:38,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2022-11-03 02:29:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:29:38,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331015521] [2022-11-03 02:29:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:38,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:29:38,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:29:38,468 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:29:38,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 02:29:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:39,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:29:39,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:41,606 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:29:41,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2022-11-03 02:30:25,441 WARN L234 SmtUtils]: Spent 12.86s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:30:41,408 WARN L833 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:31:08,632 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from false [2022-11-03 02:31:10,677 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from true [2022-11-03 02:31:34,719 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2022-11-03 02:31:36,765 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2022-11-03 02:32:20,795 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-03 02:32:20,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:32:20,796 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:32:20,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331015521] [2022-11-03 02:32:20,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331015521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:32:20,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:32:20,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:32:20,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068300700] [2022-11-03 02:32:20,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:32:20,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:32:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:32:20,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:32:20,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=59, Unknown=8, NotChecked=54, Total=156 [2022-11-03 02:32:20,797 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-03 02:32:24,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:32:26,184 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (.cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (.cse4 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= .cse0 (let ((.cse1 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse7 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse5 .cse6) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse7) (fp.sub c_currentRoundingMode .cse6 .cse7))) (= .cse8 .cse7) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse6) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse7)))) (= .cse5 (let ((.cse9 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) .cse0)) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= .cse8 .cse4) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-03 02:32:28,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:32:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:28,854 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-11-03 02:32:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:32:28,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 14 [2022-11-03 02:32:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:28,860 INFO L225 Difference]: With dead ends: 25 [2022-11-03 02:32:28,860 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 02:32:28,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=37, Invalid=60, Unknown=9, NotChecked=76, Total=182 [2022-11-03 02:32:28,862 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:28,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 1 Unknown, 76 Unchecked, 5.9s Time] [2022-11-03 02:32:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 02:32:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 02:32:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-03 02:32:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-03 02:32:28,868 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-11-03 02:32:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:28,868 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-03 02:32:28,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-03 02:32:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-03 02:32:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:32:28,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:28,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:28,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:32:29,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:32:29,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:32:29,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1048715671, now seen corresponding path program 1 times [2022-11-03 02:32:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:32:29,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315157633] [2022-11-03 02:32:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:32:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:32:29,074 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:32:29,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 02:32:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:29,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:32:29,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:29,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:29,490 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:32:29,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315157633] [2022-11-03 02:32:29,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315157633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:29,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [686391475] [2022-11-03 02:32:29,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:29,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:32:29,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:32:29,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:32:29,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-03 02:32:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:30,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:32:30,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:30,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:30,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [686391475] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:30,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917910231] [2022-11-03 02:32:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:30,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:30,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:30,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:32:30,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:32:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:30,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:32:30,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:30,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:30,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917910231] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:30,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:32:30,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2022-11-03 02:32:30,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492345801] [2022-11-03 02:32:30,415 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:32:30,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:32:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:32:30,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:32:30,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:32:30,416 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-03 02:32:32,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:32:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:32,732 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-11-03 02:32:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:32:32,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) Word has length 14 [2022-11-03 02:32:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:32,735 INFO L225 Difference]: With dead ends: 33 [2022-11-03 02:32:32,735 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:32:32,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:32:32,736 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:32,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 58 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 02:32:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:32:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-11-03 02:32:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-03 02:32:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-03 02:32:32,745 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2022-11-03 02:32:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:32,745 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-03 02:32:32,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-03 02:32:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-03 02:32:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:32:32,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:32,746 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:32,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-03 02:32:32,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:32:33,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2022-11-03 02:32:33,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:32:33,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:32:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:33,367 INFO L85 PathProgramCache]: Analyzing trace with hash -673335440, now seen corresponding path program 1 times [2022-11-03 02:32:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:32:33,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261672132] [2022-11-03 02:32:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:33,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:32:33,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:32:33,369 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:32:33,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 02:32:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:33,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 02:32:33,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:37,060 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:32:37,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 109 [2022-11-03 02:33:21,321 WARN L234 SmtUtils]: Spent 16.68s on a formula simplification. DAG size of input: 55 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:33:46,156 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse2 .cse3))) (_ +zero 11 53)))))) is different from false [2022-11-03 02:33:48,173 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse2 .cse3))) (_ +zero 11 53)))))) is different from true [2022-11-03 02:35:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:01,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:10,997 WARN L833 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from false [2022-11-03 02:35:13,071 WARN L855 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from true [2022-11-03 02:35:23,490 WARN L833 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from false [2022-11-03 02:35:25,570 WARN L855 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from true [2022-11-03 02:35:38,069 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from true [2022-11-03 02:35:52,014 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from false [2022-11-03 02:35:54,087 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from true [2022-11-03 02:36:06,889 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse3 (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)))) (_ +zero 11 53))))) is different from false [2022-11-03 02:36:08,961 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse3 (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)))) (_ +zero 11 53))))) is different from true [2022-11-03 02:36:21,042 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false [2022-11-03 02:36:23,113 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from true [2022-11-03 02:36:41,093 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false [2022-11-03 02:36:43,156 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from true [2022-11-03 02:37:06,241 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))))) is different from true [2022-11-03 02:37:16,026 WARN L234 SmtUtils]: Spent 9.76s on a formula simplification. DAG size of input: 14 DAG size of output: 1 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:37:16,027 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-03 02:37:16,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 276 treesize of output 1 [2022-11-03 02:37:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:37:16,028 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:37:16,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261672132] [2022-11-03 02:37:16,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261672132] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:37:16,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1606374957] [2022-11-03 02:37:16,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:16,029 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:37:16,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:37:16,030 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:37:16,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-03 02:37:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:17,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:37:17,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:37:45,358 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:37:45,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 98 [2022-11-03 02:37:56,814 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_18 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (exists ((v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (and (= .cse0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= .cse0 .cse3) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:38:23,308 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse2 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (_ +zero 11 53))) (= .cse2 .cse3)))) is different from false [2022-11-03 02:38:25,328 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse2 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (_ +zero 11 53))) (= .cse2 .cse3)))) is different from true [2022-11-03 02:39:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:39:37,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:41:05,614 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))))) is different from true [2022-11-03 02:41:29,747 WARN L234 SmtUtils]: Spent 24.11s on a formula simplification. DAG size of input: 14 DAG size of output: 3 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:41:29,747 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-03 02:41:29,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 113 [2022-11-03 02:42:01,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (= .cse1 .cse2)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (= (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (= .cse1 .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse0 .cse3))) (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)))) is different from false [2022-11-03 02:42:03,429 WARN L855 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (= .cse1 .cse2)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (= (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (= .cse1 .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse0 .cse3))) (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)))) is different from true [2022-11-03 02:42:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:42:03,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1606374957] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:42:03,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124759325] [2022-11-03 02:42:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:03,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:42:03,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:42:03,437 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:42:03,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_648ad230-45db-4a8c-a80d-60570f18ca0e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:42:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:08,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:42:08,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:42:14,695 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:42:14,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 98