./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:42:36,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:42:36,515 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 13:42:36,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:42:36,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:42:36,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:42:36,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:42:36,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:42:36,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:42:36,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:42:36,548 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:42:36,549 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:42:36,549 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:42:36,550 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:42:36,550 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:42:36,551 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:42:36,551 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:42:36,552 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:42:36,552 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:42:36,553 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:42:36,553 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:42:36,554 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:42:36,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:42:36,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:42:36,556 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:42:36,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:42:36,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:42:36,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:42:36,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:42:36,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:42:36,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:42:36,559 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:42:36,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:42:36,559 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:42:36,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:42:36,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:42:36,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:42:36,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:42:36,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:42:36,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:42:36,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:42:36,562 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:42:36,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:42:36,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:42:36,562 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:42:36,563 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:42:36,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:42:36,563 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/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_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2023-12-02 13:42:36,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:42:36,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:42:36,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:42:36,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:42:36,814 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:42:36,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2023-12-02 13:42:39,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:42:39,705 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:42:39,705 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2023-12-02 13:42:39,711 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/data/ffa1cdbc3/5162ba1d8d7f4ffca3921bf73ff14d97/FLAGf725c9f42 [2023-12-02 13:42:39,723 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/data/ffa1cdbc3/5162ba1d8d7f4ffca3921bf73ff14d97 [2023-12-02 13:42:39,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:42:39,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:42:39,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:42:39,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:42:39,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:42:39,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c2bde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39, skipping insertion in model container [2023-12-02 13:42:39,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,761 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:42:39,890 WARN L240 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_8c817680-4c9f-4b06-a020-1828eb929ab5/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2023-12-02 13:42:39,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:42:39,908 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:42:39,922 WARN L240 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_8c817680-4c9f-4b06-a020-1828eb929ab5/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2023-12-02 13:42:39,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:42:39,936 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:42:39,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39 WrapperNode [2023-12-02 13:42:39,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:42:39,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:42:39,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:42:39,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:42:39,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,963 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-12-02 13:42:39,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:42:39,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:42:39,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:42:39,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:42:39,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:42:39,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:42:39,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:42:39,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:42:39,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (1/1) ... [2023-12-02 13:42:39,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:42:39,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:42:40,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:42:40,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:42:40,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:42:40,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:42:40,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:42:40,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:42:40,105 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:42:40,106 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:42:40,220 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:42:40,250 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:42:40,250 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 13:42:40,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:42:40 BoogieIcfgContainer [2023-12-02 13:42:40,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:42:40,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:42:40,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:42:40,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:42:40,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:42:39" (1/3) ... [2023-12-02 13:42:40,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d6da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:42:40, skipping insertion in model container [2023-12-02 13:42:40,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:39" (2/3) ... [2023-12-02 13:42:40,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d6da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:42:40, skipping insertion in model container [2023-12-02 13:42:40,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:42:40" (3/3) ... [2023-12-02 13:42:40,261 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2023-12-02 13:42:40,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:42:40,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 13:42:40,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:42:40,337 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=LoopHeads, 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;@4e98b3c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:42:40,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 13:42:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 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) [2023-12-02 13:42:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:42:40,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:40,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:40,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:40,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1090715464, now seen corresponding path program 1 times [2023-12-02 13:42:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:42:40,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591475821] [2023-12-02 13:42:40,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:40,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:42:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:42:40,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:42:40,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591475821] [2023-12-02 13:42:40,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591475821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:42:40,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:42:40,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:42:40,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129574348] [2023-12-02 13:42:40,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:42:40,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:42:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:42:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:42:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:42:40,574 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-12-02 13:42:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:40,605 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2023-12-02 13:42:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:42:40,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-12-02 13:42:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:40,616 INFO L225 Difference]: With dead ends: 31 [2023-12-02 13:42:40,616 INFO L226 Difference]: Without dead ends: 12 [2023-12-02 13:42:40,619 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 [2023-12-02 13:42:40,623 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:40,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 29 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:42:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-02 13:42:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-02 13:42:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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) [2023-12-02 13:42:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-02 13:42:40,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2023-12-02 13:42:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:40,647 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-02 13:42:40,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-12-02 13:42:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-02 13:42:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:42:40,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:40,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:40,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:42:40,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:40,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash -201086419, now seen corresponding path program 1 times [2023-12-02 13:42:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:42:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476193606] [2023-12-02 13:42:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:42:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:42:40,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:42:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476193606] [2023-12-02 13:42:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476193606] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:42:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:42:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:42:40,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511460209] [2023-12-02 13:42:40,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:42:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:42:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:42:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:42:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:42:40,752 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-12-02 13:42:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:40,835 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-12-02 13:42:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:42:40,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2023-12-02 13:42:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:40,837 INFO L225 Difference]: With dead ends: 29 [2023-12-02 13:42:40,837 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 13:42:40,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:42:40,839 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:40,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:42:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 13:42:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 14. [2023-12-02 13:42:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2023-12-02 13:42:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-02 13:42:40,844 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2023-12-02 13:42:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:40,844 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-02 13:42:40,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-12-02 13:42:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-02 13:42:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:42:40,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:40,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:40,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:42:40,846 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:40,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash -184075758, now seen corresponding path program 1 times [2023-12-02 13:42:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:42:40,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840556592] [2023-12-02 13:42:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:40,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:42:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:42:40,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 13:42:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:42:40,885 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 13:42:40,886 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 13:42:40,887 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 13:42:40,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 13:42:40,892 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-02 13:42:40,896 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 13:42:40,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:42:40 BoogieIcfgContainer [2023-12-02 13:42:40,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 13:42:40,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 13:42:40,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 13:42:40,914 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 13:42:40,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:42:40" (3/4) ... [2023-12-02 13:42:40,917 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 13:42:40,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 13:42:40,919 INFO L158 Benchmark]: Toolchain (without parser) took 1191.36ms. Allocated memory is still 138.4MB. Free memory was 96.4MB in the beginning and 87.4MB in the end (delta: 9.0MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2023-12-02 13:42:40,919 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:42:40,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.62ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 84.9MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 13:42:40,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.59ms. Allocated memory is still 138.4MB. Free memory was 84.9MB in the beginning and 83.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:42:40,921 INFO L158 Benchmark]: Boogie Preprocessor took 16.58ms. Allocated memory is still 138.4MB. Free memory was 83.7MB in the beginning and 82.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:42:40,921 INFO L158 Benchmark]: RCFGBuilder took 270.26ms. Allocated memory is still 138.4MB. Free memory was 82.3MB in the beginning and 71.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 13:42:40,922 INFO L158 Benchmark]: TraceAbstraction took 658.95ms. Allocated memory is still 138.4MB. Free memory was 71.2MB in the beginning and 87.4MB in the end (delta: -16.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:42:40,922 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 138.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:42:40,925 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.62ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 84.9MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.59ms. Allocated memory is still 138.4MB. Free memory was 84.9MB in the beginning and 83.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.58ms. Allocated memory is still 138.4MB. Free memory was 83.7MB in the beginning and 82.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 270.26ms. Allocated memory is still 138.4MB. Free memory was 82.3MB in the beginning and 71.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 658.95ms. Allocated memory is still 138.4MB. Free memory was 71.2MB in the beginning and 87.4MB in the end (delta: -16.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 138.4MB. Free memory is still 87.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: 56]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of to_real at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80. Possible FailurePath: [L1] int __return_main; [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L39] main__S = 0 [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main____CPAchecker_TMP_2=0, main__i=0] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main____CPAchecker_TMP_2=0, main__i=0] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main____CPAchecker_TMP_2=0, main__i=0] [L56] reach_error() VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main____CPAchecker_TMP_2=0, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 34 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 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 [2023-12-02 13:42:40,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:42:42,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:42:42,935 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 13:42:42,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:42:42,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:42:42,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:42:42,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:42:42,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:42:42,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:42:42,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:42:42,973 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:42:42,973 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:42:42,974 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:42:42,975 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:42:42,975 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:42:42,976 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:42:42,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:42:42,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:42:42,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:42:42,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:42:42,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:42:42,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:42:42,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:42:42,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:42:42,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:42:42,982 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 13:42:42,983 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 13:42:42,983 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:42:42,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:42:42,984 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:42:42,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:42:42,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 13:42:42,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:42:42,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:42:42,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:42:42,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:42:42,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:42:42,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:42:42,987 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 13:42:42,987 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 13:42:42,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:42:42,988 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:42:42,988 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:42:42,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:42:42,988 INFO L153 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_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/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_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2023-12-02 13:42:43,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:42:43,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:42:43,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:42:43,288 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:42:43,289 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:42:43,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2023-12-02 13:42:46,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:42:46,271 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:42:46,272 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2023-12-02 13:42:46,278 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/data/303524091/8ecdaa5ebd2647bb97df3821ce9993c0/FLAG6bcdeda40 [2023-12-02 13:42:46,291 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/data/303524091/8ecdaa5ebd2647bb97df3821ce9993c0 [2023-12-02 13:42:46,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:42:46,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:42:46,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:42:46,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:42:46,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:42:46,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6faf053b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46, skipping insertion in model container [2023-12-02 13:42:46,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,321 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:42:46,454 WARN L240 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_8c817680-4c9f-4b06-a020-1828eb929ab5/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2023-12-02 13:42:46,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:42:46,474 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:42:46,489 WARN L240 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_8c817680-4c9f-4b06-a020-1828eb929ab5/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2023-12-02 13:42:46,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:42:46,505 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:42:46,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46 WrapperNode [2023-12-02 13:42:46,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:42:46,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:42:46,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:42:46,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:42:46,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,536 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-12-02 13:42:46,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:42:46,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:42:46,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:42:46,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:42:46,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:42:46,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:42:46,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:42:46,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:42:46,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (1/1) ... [2023-12-02 13:42:46,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:42:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:42:46,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:42:46,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:42:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:42:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 13:42:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:42:46,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:42:46,724 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:42:46,727 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:42:48,923 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:42:48,952 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:42:48,953 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 13:42:48,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:42:48 BoogieIcfgContainer [2023-12-02 13:42:48,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:42:48,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:42:48,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:42:48,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:42:48,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:42:46" (1/3) ... [2023-12-02 13:42:48,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2230183b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:42:48, skipping insertion in model container [2023-12-02 13:42:48,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:42:46" (2/3) ... [2023-12-02 13:42:48,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2230183b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:42:48, skipping insertion in model container [2023-12-02 13:42:48,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:42:48" (3/3) ... [2023-12-02 13:42:48,964 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2023-12-02 13:42:48,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:42:48,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 13:42:49,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:42:49,044 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=LoopHeads, 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;@159f65c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:42:49,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 13:42:49,049 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) [2023-12-02 13:42:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:42:49,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:49,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:49,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:49,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1321548500, now seen corresponding path program 1 times [2023-12-02 13:42:49,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:42:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345583520] [2023-12-02 13:42:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:49,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:42:49,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:42:49,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 13:42:49,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 13:42:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:49,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:42:49,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:42:49,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:42:49,199 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:42:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345583520] [2023-12-02 13:42:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345583520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:42:49,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:42:49,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:42:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53690599] [2023-12-02 13:42:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:42:49,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:42:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:42:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:42:49,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:42:49,239 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 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) [2023-12-02 13:42:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:49,293 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2023-12-02 13:42:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:42:49,296 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 [2023-12-02 13:42:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:49,303 INFO L225 Difference]: With dead ends: 35 [2023-12-02 13:42:49,303 INFO L226 Difference]: Without dead ends: 14 [2023-12-02 13:42:49,306 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 [2023-12-02 13:42:49,309 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:49,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:42:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-02 13:42:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-02 13:42:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2023-12-02 13:42:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2023-12-02 13:42:49,335 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 12 [2023-12-02 13:42:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:49,335 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2023-12-02 13:42:49,335 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) [2023-12-02 13:42:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2023-12-02 13:42:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:42:49,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:49,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:49,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:42:49,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:42:49,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:49,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1145487481, now seen corresponding path program 1 times [2023-12-02 13:42:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:42:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212369017] [2023-12-02 13:42:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:49,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:42:49,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:42:49,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 13:42:49,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 13:42:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:49,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:42:49,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:42:49,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:42:49,657 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:42:49,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212369017] [2023-12-02 13:42:49,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212369017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:42:49,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:42:49,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:42:49,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577481916] [2023-12-02 13:42:49,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:42:49,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:42:49,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:42:49,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:42:49,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:42:49,662 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-12-02 13:42:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:49,765 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-12-02 13:42:49,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:42:49,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2023-12-02 13:42:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:49,767 INFO L225 Difference]: With dead ends: 29 [2023-12-02 13:42:49,767 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 13:42:49,767 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 [2023-12-02 13:42:49,769 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:49,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 54 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:42:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 13:42:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2023-12-02 13:42:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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) [2023-12-02 13:42:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-02 13:42:49,774 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2023-12-02 13:42:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:49,775 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-02 13:42:49,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-12-02 13:42:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-02 13:42:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:42:49,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:49,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:49,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 13:42:49,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:42:49,977 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:49,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1162498142, now seen corresponding path program 1 times [2023-12-02 13:42:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:42:49,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921627288] [2023-12-02 13:42:49,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:49,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:42:49,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:42:49,979 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 13:42:49,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 13:42:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:50,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:42:50,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:42:50,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:42:50,069 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:42:50,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921627288] [2023-12-02 13:42:50,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921627288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:42:50,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:42:50,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:42:50,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707890114] [2023-12-02 13:42:50,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:42:50,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:42:50,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:42:50,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:42:50,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:42:50,071 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. 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) [2023-12-02 13:42:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:50,565 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-12-02 13:42:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:42:50,566 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 [2023-12-02 13:42:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:50,566 INFO L225 Difference]: With dead ends: 41 [2023-12-02 13:42:50,566 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 13:42:50,567 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 [2023-12-02 13:42:50,568 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:50,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 13:42:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 13:42:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2023-12-02 13:42:50,572 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) [2023-12-02 13:42:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-02 13:42:50,573 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2023-12-02 13:42:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:50,573 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-02 13:42:50,573 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) [2023-12-02 13:42:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-02 13:42:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:42:50,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:50,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:50,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-02 13:42:50,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:42:50,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:50,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1875253687, now seen corresponding path program 1 times [2023-12-02 13:42:50,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:42:50,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361604475] [2023-12-02 13:42:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:50,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:42:50,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:42:50,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 13:42:50,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 13:42:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:51,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:42:51,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:42:51,812 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:42:51,812 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:42:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361604475] [2023-12-02 13:42:51,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361604475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:42:51,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:42:51,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:42:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308605335] [2023-12-02 13:42:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:42:51,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:42:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:42:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:42:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:42:51,815 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2023-12-02 13:42:55,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:42:57,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:42:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:57,400 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-12-02 13:42:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:42:57,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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 [2023-12-02 13:42:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:57,439 INFO L225 Difference]: With dead ends: 56 [2023-12-02 13:42:57,439 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 13:42:57,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:42:57,441 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:57,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2023-12-02 13:42:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 13:42:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2023-12-02 13:42:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2023-12-02 13:42:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-12-02 13:42:57,444 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 12 [2023-12-02 13:42:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:57,445 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-12-02 13:42:57,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2023-12-02 13:42:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-12-02 13:42:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:42:57,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:57,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:57,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 13:42:57,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:42:57,647 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:57,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1153539196, now seen corresponding path program 1 times [2023-12-02 13:42:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:42:57,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587997466] [2023-12-02 13:42:57,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:57,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:42:57,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:42:57,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 13:42:57,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 13:42:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:58,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 13:42:58,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:43:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:43:13,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:43:21,435 WARN L854 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2023-12-02 13:43:23,480 WARN L876 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2023-12-02 13:43:37,899 WARN L854 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2023-12-02 13:43:39,946 WARN L876 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2023-12-02 13:43:54,450 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2023-12-02 13:45:11,278 WARN L876 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse0))))) is different from true [2023-12-02 13:45:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 13:45:20,707 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:45:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587997466] [2023-12-02 13:45:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587997466] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:45:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1147142611] [2023-12-02 13:45:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:20,708 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:45:20,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:45:20,709 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:45:20,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-02 13:45:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:21,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 13:45:21,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:45:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:32,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:47:16,634 WARN L876 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0))))) is different from true [2023-12-02 13:47:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 13:47:32,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1147142611] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:47:32,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118455595] [2023-12-02 13:47:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:47:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:47:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:47:32,393 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:47:32,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 13:47:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:47:35,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 13:47:35,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:47:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:47:54,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:49:27,725 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2023-12-02 13:49:42,301 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1)))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2023-12-02 13:49:56,904 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)))) is different from true [2023-12-02 13:50:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-02 13:50:01,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118455595] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:50:01,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 13:50:01,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 8, 10, 10] total 21 [2023-12-02 13:50:01,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086828408] [2023-12-02 13:50:01,010 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 13:50:01,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 13:50:01,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:50:01,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 13:50:01,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=98, Unknown=14, NotChecked=232, Total=420 [2023-12-02 13:50:01,013 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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) [2023-12-02 13:50:02,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:50:13,695 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse1)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse3))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-02 13:50:16,846 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (let ((.cse1 (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)))))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (or .cse1 (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse2))) .cse1 (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse3) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2023-12-02 13:50:19,361 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-02 13:50:22,462 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse5 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2))) (.cse0 (fp.neg .cse2))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse2) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse4) .cse5) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse4))) .cse5) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-02 13:50:24,531 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse5 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2))) (.cse0 (fp.neg .cse2))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse2) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse4) .cse5) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse4))) .cse5) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-02 13:50:27,011 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-02 13:50:29,322 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-02 13:50:31,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse3)))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse3))))))) is different from false [2023-12-02 13:50:33,466 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse3)))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse3))))))) is different from true [2023-12-02 13:50:36,578 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse1)))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse3))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-02 13:50:38,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:50:40,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:50:42,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:50:44,893 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))))) (and (or .cse0 (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1))) .cse0))) is different from true [2023-12-02 13:50:46,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:50:54,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:50:56,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:50:58,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:00,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:02,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:03,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:06,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:08,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:10,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:12,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:14,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:24,003 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse2 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse3)))) (and (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) .cse2) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| (fp.neg .cse3))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1))) .cse2)))) is different from false [2023-12-02 13:51:26,069 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse2 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse3)))) (and (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) .cse2) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| (fp.neg .cse3))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1))) .cse2)))) is different from true [2023-12-02 13:51:27,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:28,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:50,411 WARN L293 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:52:16,994 WARN L293 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:52:19,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (and (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse2))))))) is different from false [2023-12-02 13:52:21,117 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (and (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse2))))))) is different from true [2023-12-02 13:52:24,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:52:26,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:52:28,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:52:31,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:52:33,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:52:35,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:53:03,767 WARN L293 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:53:19,101 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (let ((.cse4 (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse2)) (.cse5 (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse0 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse3)))) .cse4 (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_16| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~main__E0~0#1_16|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_16| .cse3)))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))) (not .cse4)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse3))))))) is different from true [2023-12-02 13:53:21,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:53:23,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:53:25,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:53:27,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:53:29,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:53:31,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:53:34,198 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (let ((.cse1 (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse3)) (.cse0 (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse3) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))))) (and (or .cse0 (not .cse1)) .cse1 .cse0))) is different from true [2023-12-02 13:53:37,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:53:39,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:53:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:39,868 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2023-12-02 13:53:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 13:53:39,932 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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 22 [2023-12-02 13:53:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:39,934 INFO L225 Difference]: With dead ends: 124 [2023-12-02 13:53:39,934 INFO L226 Difference]: Without dead ends: 106 [2023-12-02 13:53:39,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 206.0s TimeCoverageRelationStatistics Valid=149, Invalid=248, Unknown=67, NotChecked=1176, Total=1640 [2023-12-02 13:53:39,936 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 120 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 1101 IncrementalHoareTripleChecker+Unchecked, 75.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:39,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 126 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 26 Unknown, 1101 Unchecked, 75.0s Time] [2023-12-02 13:53:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-02 13:53:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 36. [2023-12-02 13:53:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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) [2023-12-02 13:53:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-12-02 13:53:39,942 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2023-12-02 13:53:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:39,943 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-12-02 13:53:39,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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) [2023-12-02 13:53:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-12-02 13:53:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:53:39,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:39,944 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:39,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 13:53:40,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 13:53:40,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-02 13:53:40,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 13:53:40,546 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:53:40,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:40,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1680535139, now seen corresponding path program 1 times [2023-12-02 13:53:40,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:40,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472955363] [2023-12-02 13:53:40,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:40,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:53:40,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:40,548 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 13:53:40,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c817680-4c9f-4b06-a020-1828eb929ab5/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 13:53:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:42,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 13:53:42,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:54:09,676 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 13:54:55,873 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2023-12-02 13:54:57,903 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2023-12-02 13:56:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 13:56:07,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:56:13,352 WARN L854 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2023-12-02 13:56:15,410 WARN L876 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2023-12-02 13:56:29,931 WARN L854 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2023-12-02 13:56:31,986 WARN L876 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2023-12-02 13:56:46,644 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2023-12-02 13:57:39,048 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2023-12-02 13:57:53,756 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse2)) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1))))) is different from true