./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.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_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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_8bad14f1-41a7-47ce-907f-fd434715606a/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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:45:42,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:45:42,118 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 18:45:42,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:45:42,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:45:42,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:45:42,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:45:42,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:45:42,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:45:42,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:45:42,161 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:45:42,162 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:45:42,162 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:45:42,163 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:45:42,163 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:45:42,164 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:45:42,165 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:45:42,165 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:45:42,166 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:45:42,166 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:45:42,167 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:45:42,169 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:45:42,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:45:42,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:45:42,171 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:45:42,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:45:42,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:45:42,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:45:42,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:45:42,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:45:42,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:45:42,174 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:45:42,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:45:42,181 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:45:42,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:45:42,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:45:42,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:45:42,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:45:42,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:45:42,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:45:42,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:45:42,183 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:45:42,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:45:42,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:45:42,183 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:45:42,183 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:45:42,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:45:42,184 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_8bad14f1-41a7-47ce-907f-fd434715606a/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_8bad14f1-41a7-47ce-907f-fd434715606a/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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2023-12-02 18:45:42,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:45:42,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:45:42,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:45:42,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:45:42,408 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:45:42,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/interpolation2.c [2023-12-02 18:45:45,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:45:45,416 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:45:45,416 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/sv-benchmarks/c/float-benchs/interpolation2.c [2023-12-02 18:45:45,423 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/data/3fec38fe2/50ecbc790f5d4387917d2729ae556309/FLAG07102c154 [2023-12-02 18:45:45,435 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/data/3fec38fe2/50ecbc790f5d4387917d2729ae556309 [2023-12-02 18:45:45,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:45:45,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:45:45,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:45:45,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:45:45,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:45:45,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3860139e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45, skipping insertion in model container [2023-12-02 18:45:45,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,461 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:45:45,576 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_8bad14f1-41a7-47ce-907f-fd434715606a/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2023-12-02 18:45:45,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:45:45,604 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:45:45,614 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_8bad14f1-41a7-47ce-907f-fd434715606a/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2023-12-02 18:45:45,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:45:45,641 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:45:45,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45 WrapperNode [2023-12-02 18:45:45,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:45:45,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:45:45,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:45:45,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:45:45,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,674 INFO L138 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2023-12-02 18:45:45,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:45:45,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:45:45,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:45:45,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:45:45,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:45:45,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:45:45,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:45:45,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:45:45,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (1/1) ... [2023-12-02 18:45:45,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:45:45,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:45:45,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:45:45,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:45:45,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:45:45,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 18:45:45,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:45:45,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-12-02 18:45:45,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:45:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:45:45,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-12-02 18:45:45,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:45:45,836 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:45:45,839 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:45:46,000 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:45:46,089 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:45:46,090 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 18:45:46,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:45:46 BoogieIcfgContainer [2023-12-02 18:45:46,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:45:46,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:45:46,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:45:46,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:45:46,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:45:45" (1/3) ... [2023-12-02 18:45:46,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fef0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:45:46, skipping insertion in model container [2023-12-02 18:45:46,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:45" (2/3) ... [2023-12-02 18:45:46,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fef0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:45:46, skipping insertion in model container [2023-12-02 18:45:46,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:45:46" (3/3) ... [2023-12-02 18:45:46,101 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2023-12-02 18:45:46,116 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:45:46,116 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 18:45:46,158 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:45:46,164 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;@2638a04f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:45:46,164 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 18:45:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 18:45:46,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:46,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 18:45:46,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:45:46,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash 85773351, now seen corresponding path program 1 times [2023-12-02 18:45:46,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:45:46,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931705487] [2023-12-02 18:45:46,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:46,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:45:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:46,422 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 18:45:46,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:45:46,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931705487] [2023-12-02 18:45:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931705487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:45:46,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806794654] [2023-12-02 18:45:46,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:46,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:45:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:45:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:45:46,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:45:46,458 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 18:45:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:46,515 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2023-12-02 18:45:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:45:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-02 18:45:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:46,525 INFO L225 Difference]: With dead ends: 22 [2023-12-02 18:45:46,525 INFO L226 Difference]: Without dead ends: 13 [2023-12-02 18:45:46,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:45:46,532 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:46,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:45:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-02 18:45:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2023-12-02 18:45:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-12-02 18:45:46,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2023-12-02 18:45:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:46,581 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-12-02 18:45:46,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 18:45:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-12-02 18:45:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 18:45:46,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:46,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 18:45:46,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 18:45:46,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:45:46,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1666710841, now seen corresponding path program 1 times [2023-12-02 18:45:46,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:45:46,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412844443] [2023-12-02 18:45:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:45:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:45:46,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 18:45:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:45:46,651 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 18:45:46,651 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 18:45:46,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 18:45:46,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 18:45:46,659 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-02 18:45:46,662 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 18:45:46,678 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated [2023-12-02 18:45:46,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:45:46 BoogieIcfgContainer [2023-12-02 18:45:46,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 18:45:46,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 18:45:46,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 18:45:46,688 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 18:45:46,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:45:46" (3/4) ... [2023-12-02 18:45:46,691 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 18:45:46,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 18:45:46,693 INFO L158 Benchmark]: Toolchain (without parser) took 1255.02ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 106.6MB in the beginning and 148.8MB in the end (delta: -42.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:45:46,694 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory was 115.2MB in the beginning and 115.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:45:46,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.87ms. Allocated memory is still 148.9MB. Free memory was 106.6MB in the beginning and 95.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 18:45:46,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.40ms. Allocated memory is still 148.9MB. Free memory was 95.3MB in the beginning and 93.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:45:46,695 INFO L158 Benchmark]: Boogie Preprocessor took 23.16ms. Allocated memory is still 148.9MB. Free memory was 93.6MB in the beginning and 91.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:45:46,696 INFO L158 Benchmark]: RCFGBuilder took 392.82ms. Allocated memory is still 148.9MB. Free memory was 91.9MB in the beginning and 75.6MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 18:45:46,697 INFO L158 Benchmark]: TraceAbstraction took 592.63ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 74.7MB in the beginning and 148.8MB in the end (delta: -74.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:45:46,697 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 186.6MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:45:46,700 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.17ms. Allocated memory is still 148.9MB. Free memory was 115.2MB in the beginning and 115.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.87ms. Allocated memory is still 148.9MB. Free memory was 106.6MB in the beginning and 95.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.40ms. Allocated memory is still 148.9MB. Free memory was 95.3MB in the beginning and 93.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.16ms. Allocated memory is still 148.9MB. Free memory was 93.6MB in the beginning and 91.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.82ms. Allocated memory is still 148.9MB. Free memory was 91.9MB in the beginning and 75.6MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 592.63ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 74.7MB in the beginning and 148.8MB in the end (delta: -74.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 186.6MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 9]: 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 someBinaryFLOATComparisonOperation at line 28, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L20] t = __VERIFIER_nondet_float() [L21] EXPR min[0] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L23] i = 0 VAL [i=0, max={4:0}, min={7:0}, org={5:0}, slope={6:0}] [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) [L24] EXPR max[i] VAL [i=0, max={4:0}, min={7:0}, org={5:0}, slope={6:0}] [L24] COND TRUE t <= max[i] [L26] EXPR org[i] [L26] EXPR slope[i] [L26] EXPR min[i] [L26] EXPR max[i] [L26] EXPR min[i] [L26] z = org[i] + slope[i] * (t - min[i]) / (max[i] - min[i]) [L28] CALL __VERIFIER_assert(z >= -10.f && z <= 30.f) [L9] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 5 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-02 18:45:46,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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_8bad14f1-41a7-47ce-907f-fd434715606a/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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:45:49,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:45:49,144 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 18:45:49,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:45:49,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:45:49,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:45:49,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:45:49,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:45:49,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:45:49,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:45:49,189 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:45:49,190 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:45:49,190 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:45:49,191 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:45:49,192 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:45:49,192 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:45:49,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:45:49,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:45:49,195 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:45:49,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:45:49,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:45:49,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:45:49,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:45:49,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:45:49,197 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:45:49,198 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 18:45:49,198 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 18:45:49,198 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:45:49,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:45:49,199 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:45:49,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:45:49,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 18:45:49,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:45:49,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:45:49,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:45:49,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:45:49,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:45:49,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:45:49,201 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 18:45:49,202 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 18:45:49,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:45:49,202 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:45:49,202 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:45:49,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:45:49,203 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_8bad14f1-41a7-47ce-907f-fd434715606a/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_8bad14f1-41a7-47ce-907f-fd434715606a/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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2023-12-02 18:45:49,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:45:49,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:45:49,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:45:49,606 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:45:49,607 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:45:49,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/interpolation2.c [2023-12-02 18:45:52,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:45:53,080 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:45:53,081 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/sv-benchmarks/c/float-benchs/interpolation2.c [2023-12-02 18:45:53,089 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/data/4c39c3fb5/3e1741e63c994bd8abe3dc9b1c436cc0/FLAG8dfda7cb7 [2023-12-02 18:45:53,108 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/data/4c39c3fb5/3e1741e63c994bd8abe3dc9b1c436cc0 [2023-12-02 18:45:53,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:45:53,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:45:53,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:45:53,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:45:53,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:45:53,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58466971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53, skipping insertion in model container [2023-12-02 18:45:53,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,150 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:45:53,342 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_8bad14f1-41a7-47ce-907f-fd434715606a/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2023-12-02 18:45:53,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:45:53,391 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:45:53,407 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_8bad14f1-41a7-47ce-907f-fd434715606a/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2023-12-02 18:45:53,425 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:45:53,446 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:45:53,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53 WrapperNode [2023-12-02 18:45:53,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:45:53,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:45:53,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:45:53,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:45:53,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,504 INFO L138 Inliner]: procedures = 19, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2023-12-02 18:45:53,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:45:53,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:45:53,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:45:53,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:45:53,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:45:53,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:45:53,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:45:53,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:45:53,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (1/1) ... [2023-12-02 18:45:53,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:45:53,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:45:53,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:45:53,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:45:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:45:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-12-02 18:45:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 18:45:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:45:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-12-02 18:45:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:45:53,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:45:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:45:53,742 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:45:53,745 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:45:56,231 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:45:56,291 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:45:56,291 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 18:45:56,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:45:56 BoogieIcfgContainer [2023-12-02 18:45:56,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:45:56,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:45:56,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:45:56,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:45:56,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:45:53" (1/3) ... [2023-12-02 18:45:56,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6913efdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:45:56, skipping insertion in model container [2023-12-02 18:45:56,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:53" (2/3) ... [2023-12-02 18:45:56,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6913efdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:45:56, skipping insertion in model container [2023-12-02 18:45:56,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:45:56" (3/3) ... [2023-12-02 18:45:56,304 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2023-12-02 18:45:56,326 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:45:56,327 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 18:45:56,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:45:56,377 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;@341abbc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:45:56,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 18:45:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 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 18:45:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 18:45:56,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:56,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:56,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:45:56,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash 186194655, now seen corresponding path program 1 times [2023-12-02 18:45:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708429375] [2023-12-02 18:45:56,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:56,408 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 18:45:56,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:56,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:45:56,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:45:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:56,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 18:45:56,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:56,866 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 18:45:56,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:45:56,867 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708429375] [2023-12-02 18:45:56,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708429375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:56,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:56,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:45:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292832354] [2023-12-02 18:45:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:56,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 18:45:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:45:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 18:45:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 18:45:56,901 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:56,955 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2023-12-02 18:45:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 18:45:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 18:45:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:56,964 INFO L225 Difference]: With dead ends: 22 [2023-12-02 18:45:56,964 INFO L226 Difference]: Without dead ends: 11 [2023-12-02 18:45:56,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 18:45:56,971 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:56,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:45:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-02 18:45:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-02 18:45:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-02 18:45:57,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2023-12-02 18:45:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:57,000 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-02 18:45:57,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-02 18:45:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 18:45:57,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:57,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:57,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:45:57,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:45:57,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:45:57,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash 243125256, now seen corresponding path program 1 times [2023-12-02 18:45:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:57,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411537191] [2023-12-02 18:45:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:57,213 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 18:45:57,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:57,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:45:57,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:45:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:57,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:45:57,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:57,677 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 18:45:57,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:45:57,678 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411537191] [2023-12-02 18:45:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411537191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:57,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:57,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:45:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775021432] [2023-12-02 18:45:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:57,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:45:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:45:57,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:45:57,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:45:57,682 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:46:00,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:46:02,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:46:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:46:02,017 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2023-12-02 18:46:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:46:02,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 18:46:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:46:02,099 INFO L225 Difference]: With dead ends: 21 [2023-12-02 18:46:02,099 INFO L226 Difference]: Without dead ends: 17 [2023-12-02 18:46:02,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 18:46:02,101 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:46:02,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2023-12-02 18:46:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-02 18:46:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2023-12-02 18:46:02,105 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 18:46:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-02 18:46:02,107 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2023-12-02 18:46:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:46:02,107 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-02 18:46:02,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:46:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-02 18:46:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 18:46:02,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:46:02,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:46:02,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:46:02,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:46:02,310 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:46:02,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:46:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1051445847, now seen corresponding path program 1 times [2023-12-02 18:46:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:46:02,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166702335] [2023-12-02 18:46:02,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:46:02,312 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 18:46:02,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:46:02,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:46:02,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:46:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:46:03,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 18:46:03,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:46:09,506 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2023-12-02 18:46:09,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 612 treesize of output 312 [2023-12-02 18:49:17,710 WARN L854 $PredicateComparison]: unable to prove that (or (and (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse0 .cse1) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.geq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub roundNearestTiesToEven .cse1 .cse4))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse4) (= .cse4 .cse5)))) (= .cse2 .cse6)))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse1)))))) (= .cse7 .cse3)))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse7 .cse8) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse0 .cse9) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse10 .cse6) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse11)) (fp.sub roundNearestTiesToEven .cse9 .cse11))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse11) (= .cse11 .cse5))))))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse9))))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2023-12-02 18:49:48,668 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse0 .cse1) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.geq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub roundNearestTiesToEven .cse1 .cse4))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse4) (= .cse4 .cse5)))) (= .cse2 .cse6)))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse1)))))) (= .cse7 .cse3)))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse7 .cse8) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse0 .cse9) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse10 .cse6) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse11)) (fp.sub roundNearestTiesToEven .cse9 .cse11))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse11) (= .cse11 .cse5))))))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse9))))))))))) is different from false [2023-12-02 18:49:50,695 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse0 .cse1) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.geq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub roundNearestTiesToEven .cse1 .cse4))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse4) (= .cse4 .cse5)))) (= .cse2 .cse6)))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse1)))))) (= .cse7 .cse3)))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse7 .cse8) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse0 .cse9) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse10 .cse6) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse11)) (fp.sub roundNearestTiesToEven .cse9 .cse11))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse11) (= .cse11 .cse5))))))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse9))))))))))) is different from true [2023-12-02 18:49:50,696 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 18:49:50,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:49:50,696 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:49:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166702335] [2023-12-02 18:49:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166702335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:49:50,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:49:50,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 18:49:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128906371] [2023-12-02 18:49:50,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:49:50,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 18:49:50,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:49:50,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 18:49:50,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=53, Unknown=3, NotChecked=30, Total=110 [2023-12-02 18:49:50,700 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 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 18:49:54,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:49:55,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:49:57,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:49:59,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse16 (let ((.cse19 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19)))) (.cse1 (let ((.cse18 (select .cse3 (_ bv0 32)))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (let ((.cse2 (select .cse3 (_ bv16 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (or (and (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (.cse9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse4 .cse5) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse8)) (fp.sub roundNearestTiesToEven .cse5 .cse8))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse8) (= .cse8 .cse9)))) (= .cse6 .cse10)))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse5)))))) (= .cse11 .cse7)))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse11 .cse12) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse4 .cse13) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse14 .cse10) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse15 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse15)) (fp.sub roundNearestTiesToEven .cse13 .cse15))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse15) (= .cse15 .cse9))))))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse13))))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse16) (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0#1.offset|) (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse16 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse1) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (= (let ((.cse17 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-02 18:50:01,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:03,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:05,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:07,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:09,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:50:10,085 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-12-02 18:50:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 18:50:10,086 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 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 18:50:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:50:10,087 INFO L225 Difference]: With dead ends: 27 [2023-12-02 18:50:10,087 INFO L226 Difference]: Without dead ends: 23 [2023-12-02 18:50:10,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=37, Invalid=81, Unknown=4, NotChecked=60, Total=182 [2023-12-02 18:50:10,089 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:50:10,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 6 Unknown, 58 Unchecked, 16.5s Time] [2023-12-02 18:50:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-02 18:50:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2023-12-02 18:50:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-12-02 18:50:10,094 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2023-12-02 18:50:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:50:10,094 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-12-02 18:50:10,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 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 18:50:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-12-02 18:50:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 18:50:10,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:50:10,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:50:10,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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)] Ended with exit code 0 [2023-12-02 18:50:10,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:10,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:50:10,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:50:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash -371387477, now seen corresponding path program 1 times [2023-12-02 18:50:10,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:50:10,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340712271] [2023-12-02 18:50:10,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:10,297 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 18:50:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:50:10,298 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:10,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:10,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:50:10,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:10,736 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 18:50:10,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:50:10,736 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:50:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340712271] [2023-12-02 18:50:10,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340712271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:50:10,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:50:10,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:50:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896596482] [2023-12-02 18:50:10,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:50:10,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:50:10,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:50:10,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:50:10,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:50:10,739 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 18:50:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:50:10,877 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2023-12-02 18:50:10,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:50:10,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 18:50:10,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:50:10,879 INFO L225 Difference]: With dead ends: 23 [2023-12-02 18:50:10,879 INFO L226 Difference]: Without dead ends: 13 [2023-12-02 18:50:10,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:50:10,881 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:50:10,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:50:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-02 18:50:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-02 18:50:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-02 18:50:10,886 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2023-12-02 18:50:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:50:10,887 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-02 18:50:10,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 18:50:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-02 18:50:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 18:50:10,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:50:10,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:50:10,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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)] Forceful destruction successful, exit code 0 [2023-12-02 18:50:11,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:11,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:50:11,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:50:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1785767906, now seen corresponding path program 1 times [2023-12-02 18:50:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:50:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028952631] [2023-12-02 18:50:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:11,089 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 18:50:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:50:11,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:11,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:11,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:50:11,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:11,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:11,663 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:50:11,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028952631] [2023-12-02 18:50:11,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028952631] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:50:11,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [688543358] [2023-12-02 18:50:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:11,663 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:50:11,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:50:11,665 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:50:11,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-02 18:50:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:12,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:50:12,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:12,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [688543358] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:50:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831476390] [2023-12-02 18:50:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:12,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:12,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:50:12,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:50:12,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 18:50:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:12,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:50:12,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:12,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:13,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831476390] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:50:13,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 18:50:13,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2023-12-02 18:50:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843747883] [2023-12-02 18:50:13,043 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 18:50:13,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:50:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:50:13,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:50:13,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:50:13,044 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 18:50:15,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:17,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:19,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:21,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:23,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:26,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:28,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:30,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:32,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:34,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:36,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:38,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:40,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:42,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:44,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:50:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:50:44,243 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-12-02 18:50:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:50:44,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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) Word has length 11 [2023-12-02 18:50:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:50:44,335 INFO L225 Difference]: With dead ends: 34 [2023-12-02 18:50:44,335 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 18:50:44,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:50:44,337 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:50:44,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 30 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 15 Unknown, 0 Unchecked, 31.1s Time] [2023-12-02 18:50:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 18:50:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2023-12-02 18:50:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 18:50:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-02 18:50:44,341 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2023-12-02 18:50:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:50:44,341 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-02 18:50:44,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 18:50:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-02 18:50:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 18:50:44,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:50:44,342 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:50:44,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-02 18:50:44,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 18:50:44,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:44,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:44,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:50:44,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:50:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash -474163953, now seen corresponding path program 1 times [2023-12-02 18:50:44,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:50:44,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772312449] [2023-12-02 18:50:44,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:44,944 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 18:50:44,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:50:44,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:44,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/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 18:50:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:45,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 18:50:45,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:58,627 WARN L293 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 37 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 18:50:58,627 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2023-12-02 18:50:58,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 659 treesize of output 335 [2023-12-02 18:54:56,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32))) (.cse9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse8 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)))) (or (and (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11)))) (and (= .cse0 .cse1) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse1 .cse2) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (= .cse3 .cse4) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse5 .cse6) (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse7 .cse2))) .cse8))))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse7) (= .cse7 .cse9)))))))))) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11)))) (and (= .cse10 .cse1) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse1 .cse11) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse11)) (fp.sub roundNearestTiesToEven .cse14 .cse11))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse5 .cse12)))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse14) (= .cse14 .cse9)))) (= .cse3 .cse13))))))) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse10)))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (let ((.cse15 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse16 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse17 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse18 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse19 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse15 .cse1) (= .cse3 .cse16) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse17) (= .cse17 .cse9) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse15)) (fp.geq (fp.add roundNearestTiesToEven .cse18 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse16 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse19)) (fp.sub roundNearestTiesToEven .cse17 .cse19))) .cse8) (= .cse5 .cse18) (= .cse1 .cse19)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false [2023-12-02 18:55:19,371 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11)))) (and (= .cse0 .cse1) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse1 .cse2) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (= .cse3 .cse4) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse5 .cse6) (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse7 .cse2))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse7) (= .cse7 .cse8)))))))))) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11)))) (and (= .cse9 .cse1) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse1 .cse10) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse10)) (fp.sub roundNearestTiesToEven .cse13 .cse10))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse5 .cse11)))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse13) (= .cse13 .cse8)))) (= .cse3 .cse12))))))) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse9))))))))) is different from false [2023-12-02 18:55:21,388 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11)))) (and (= .cse0 .cse1) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse1 .cse2) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (= .cse3 .cse4) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse5 .cse6) (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse7 .cse2))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse7) (= .cse7 .cse8)))))))))) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11)))) (and (= .cse9 .cse1) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse1 .cse10) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse10)) (fp.sub roundNearestTiesToEven .cse13 .cse10))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse5 .cse11)))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse13) (= .cse13 .cse8)))) (= .cse3 .cse12))))))) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse9))))))))) is different from true [2023-12-02 18:55:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:55:21,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:55:32,675 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) is different from false [2023-12-02 18:55:34,776 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) is different from true [2023-12-02 18:55:50,226 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) is different from false [2023-12-02 18:55:52,338 WARN L876 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) is different from true [2023-12-02 18:56:07,707 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from false [2023-12-02 18:56:09,819 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from true [2023-12-02 18:56:29,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)))) is different from false [2023-12-02 18:56:32,076 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)))) is different from true [2023-12-02 18:56:51,877 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse9 (select .cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))) is different from false [2023-12-02 18:56:53,987 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse9 (select .cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))) is different from true [2023-12-02 18:57:13,777 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2023-12-02 18:57:15,882 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from true [2023-12-02 18:57:40,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from false [2023-12-02 18:57:42,246 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from true [2023-12-02 18:58:06,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not |c_ULTIMATE.start_main_#t~short7#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2023-12-02 18:58:08,572 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not |c_ULTIMATE.start_main_#t~short7#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from true [2023-12-02 18:58:37,245 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse9 (select .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (not |c_ULTIMATE.start_main_#t~short7#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse0 .cse6)))))) (and (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))))) is different from false [2023-12-02 18:58:39,358 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse9 (select .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (not |c_ULTIMATE.start_main_#t~short7#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse0 .cse6)))))) (and (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))))) is different from true [2023-12-02 18:58:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 18:58:39,360 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:58:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772312449] [2023-12-02 18:58:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772312449] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:58:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1663652342] [2023-12-02 18:58:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:58:39,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:58:39,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:58:39,362 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:58:39,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bad14f1-41a7-47ce-907f-fd434715606a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-02 18:58:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:58:40,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 18:58:40,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:58:54,915 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2023-12-02 18:58:54,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 667 treesize of output 339