./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/bary_diverge.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje --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 b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:07:38,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:07:38,877 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 07:07:38,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:07:38,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:07:38,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:07:38,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:07:38,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:07:38,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:07:38,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:07:38,930 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:07:38,931 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:07:38,931 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:07:38,932 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:07:38,935 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:07:38,936 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:07:38,936 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:07:38,937 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:07:38,937 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:07:38,938 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:07:38,938 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:07:38,943 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:07:38,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:07:38,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:07:38,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:07:38,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:07:38,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:07:38,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:07:38,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:07:38,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:07:38,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:07:38,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:07:38,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:07:38,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:07:38,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:07:38,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:07:38,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:07:38,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:07:38,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:07:38,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:07:38,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:07:38,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:07:38,958 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:07:38,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:07:38,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:07:38,959 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:07:38,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:07:38,960 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_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje 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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2024-11-09 07:07:39,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:07:39,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:07:39,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:07:39,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:07:39,461 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:07:39,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/bary_diverge.c Unable to find full path for "g++" [2024-11-09 07:07:42,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:07:42,573 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:07:42,576 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/sv-benchmarks/c/float-benchs/bary_diverge.c [2024-11-09 07:07:42,590 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/data/3950f2bb2/39042d7c5b854e36ab03479e0198e00f/FLAGe46eafa95 [2024-11-09 07:07:42,856 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/data/3950f2bb2/39042d7c5b854e36ab03479e0198e00f [2024-11-09 07:07:42,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:07:42,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:07:42,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:07:42,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:07:42,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:07:42,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:07:42" (1/1) ... [2024-11-09 07:07:42,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1337292c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:42, skipping insertion in model container [2024-11-09 07:07:42,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:07:42" (1/1) ... [2024-11-09 07:07:42,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:07:43,314 WARN L250 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_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2024-11-09 07:07:43,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:07:43,368 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:07:43,390 WARN L250 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_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2024-11-09 07:07:43,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:07:43,428 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:07:43,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43 WrapperNode [2024-11-09 07:07:43,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:07:43,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:07:43,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:07:43,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:07:43,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,488 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 68 [2024-11-09 07:07:43,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:07:43,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:07:43,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:07:43,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:07:43,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:07:43,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:07:43,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:07:43,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:07:43,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (1/1) ... [2024-11-09 07:07:43,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:07:43,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:07:43,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:07:43,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:07:43,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:07:43,647 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2024-11-09 07:07:43,647 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2024-11-09 07:07:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:07:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:07:43,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:07:43,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:07:43,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:07:44,091 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 07:07:44,091 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:07:44,188 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:07:44,188 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:07:44,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:07:44 BoogieIcfgContainer [2024-11-09 07:07:44,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:07:44,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:07:44,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:07:44,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:07:44,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:07:42" (1/3) ... [2024-11-09 07:07:44,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb84a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:07:44, skipping insertion in model container [2024-11-09 07:07:44,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:43" (2/3) ... [2024-11-09 07:07:44,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb84a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:07:44, skipping insertion in model container [2024-11-09 07:07:44,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:07:44" (3/3) ... [2024-11-09 07:07:44,204 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2024-11-09 07:07:44,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:07:44,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 07:07:44,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:07:44,344 INFO L333 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, 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;@71b2e4c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:07:44,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 07:07:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:07:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:07:44,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:07:44,364 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:07:44,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:07:44,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:07:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash 869099916, now seen corresponding path program 1 times [2024-11-09 07:07:44,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:07:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397051315] [2024-11-09 07:07:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:07:44,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:07:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:07:44,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:07:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:07:44,623 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 07:07:44,626 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:07:44,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 07:07:44,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:07:44,639 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 07:07:44,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:07:44,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:07:44 BoogieIcfgContainer [2024-11-09 07:07:44,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:07:44,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:07:44,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:07:44,683 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:07:44,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:07:44" (3/4) ... [2024-11-09 07:07:44,689 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:07:44,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:07:44,693 INFO L158 Benchmark]: Toolchain (without parser) took 1829.12ms. Allocated memory is still 157.3MB. Free memory was 117.3MB in the beginning and 84.9MB in the end (delta: 32.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-09 07:07:44,694 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 109.1MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:07:44,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.22ms. Allocated memory is still 157.3MB. Free memory was 116.8MB in the beginning and 119.9MB in the end (delta: -3.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:07:44,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.90ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 118.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:07:44,697 INFO L158 Benchmark]: Boogie Preprocessor took 43.03ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 117.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:07:44,698 INFO L158 Benchmark]: RCFGBuilder took 656.08ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 101.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:07:44,700 INFO L158 Benchmark]: TraceAbstraction took 487.76ms. Allocated memory is still 157.3MB. Free memory was 101.1MB in the beginning and 85.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:07:44,701 INFO L158 Benchmark]: Witness Printer took 9.06ms. Allocated memory is still 157.3MB. Free memory was 85.4MB in the beginning and 84.9MB in the end (delta: 556.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:07:44,706 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.43ms. Allocated memory is still 109.1MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.22ms. Allocated memory is still 157.3MB. Free memory was 116.8MB in the beginning and 119.9MB in the end (delta: -3.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.90ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 118.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.03ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 117.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 656.08ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 101.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 487.76ms. Allocated memory is still 157.3MB. Free memory was 101.1MB in the beginning and 85.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 9.06ms. Allocated memory is still 157.3MB. Free memory was 85.4MB in the beginning and 84.9MB in the end (delta: 556.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 14]: 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 36, overapproximation of someBinaryArithmeticFLOAToperation at line 47. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float C1, I; [L34] static float X,Y,Z; [L55] int i; [L57] INIT = TRUE VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L58] CALL, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; [L58] RET, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L58] C1 = RANDOM_INPUT() [L59] CALL, EXPR RANDOM_INPUT() VAL [C1=53, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; [L59] RET, EXPR RANDOM_INPUT() VAL [C1=53, I=0, INIT=1, X=0, Y=0, Z=0] [L59] I = RANDOM_INPUT() [L61] i = 0 VAL [C1=53, I=0, INIT=1, X=0, Y=0, Z=0, i=0] [L61] COND FALSE !(i < 3600000) VAL [C1=53, I=0, INIT=1, X=0, Y=0, Z=0, i=0] [L61] COND TRUE i < 3600000 [L62] CALL bary() [L36] COND FALSE !(C1 > 0.f) [L41] COND TRUE INIT == TRUE [L42] X = I [L43] Y = I [L44] Z = I [L50] CALL __VERIFIER_assert(X >= -5.f && X <= 5.f) [L14] COND TRUE !(cond) VAL [C1=53, I=0, INIT=1, X=0, Y=0, Z=0] [L14] reach_error() VAL [C1=53, I=0, INIT=1, X=0, Y=0, Z=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 07:07:44,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje --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 b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:07:47,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:07:48,152 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 07:07:48,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:07:48,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:07:48,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:07:48,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:07:48,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:07:48,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:07:48,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:07:48,226 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:07:48,226 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:07:48,227 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:07:48,229 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:07:48,230 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:07:48,230 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:07:48,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:07:48,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:07:48,235 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:07:48,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:07:48,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:07:48,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:07:48,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:07:48,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:07:48,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:07:48,243 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:07:48,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:07:48,244 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:07:48,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:07:48,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:07:48,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:07:48,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:07:48,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:07:48,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:07:48,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:07:48,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:07:48,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:07:48,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:07:48,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:07:48,253 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 07:07:48,253 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:07:48,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:07:48,254 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:07:48,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje 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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2024-11-09 07:07:48,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:07:48,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:07:48,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:07:48,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:07:48,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:07:48,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/bary_diverge.c Unable to find full path for "g++" [2024-11-09 07:07:51,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:07:52,263 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:07:52,264 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/sv-benchmarks/c/float-benchs/bary_diverge.c [2024-11-09 07:07:52,273 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/data/66b338285/34bd798a8b034180bd185cc7013838ac/FLAGa4e2f2d2e [2024-11-09 07:07:52,567 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/data/66b338285/34bd798a8b034180bd185cc7013838ac [2024-11-09 07:07:52,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:07:52,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:07:52,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:07:52,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:07:52,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:07:52,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:07:52" (1/1) ... [2024-11-09 07:07:52,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@107ecf13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:52, skipping insertion in model container [2024-11-09 07:07:52,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:07:52" (1/1) ... [2024-11-09 07:07:52,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:07:52,888 WARN L250 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_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2024-11-09 07:07:52,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:07:52,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:07:52,982 WARN L250 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_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2024-11-09 07:07:53,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:07:53,037 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:07:53,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53 WrapperNode [2024-11-09 07:07:53,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:07:53,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:07:53,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:07:53,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:07:53,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,112 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2024-11-09 07:07:53,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:07:53,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:07:53,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:07:53,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:07:53,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:07:53,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:07:53,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:07:53,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:07:53,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (1/1) ... [2024-11-09 07:07:53,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:07:53,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:07:53,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:07:53,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:07:53,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:07:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2024-11-09 07:07:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2024-11-09 07:07:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 07:07:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:07:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:07:53,517 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:07:53,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:07:55,854 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 07:07:55,855 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:07:55,875 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:07:55,875 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:07:55,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:07:55 BoogieIcfgContainer [2024-11-09 07:07:55,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:07:55,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:07:55,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:07:55,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:07:55,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:07:52" (1/3) ... [2024-11-09 07:07:55,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d08bfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:07:55, skipping insertion in model container [2024-11-09 07:07:55,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:07:53" (2/3) ... [2024-11-09 07:07:55,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d08bfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:07:55, skipping insertion in model container [2024-11-09 07:07:55,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:07:55" (3/3) ... [2024-11-09 07:07:55,891 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2024-11-09 07:07:55,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:07:55,918 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 07:07:56,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:07:56,027 INFO L333 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, 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;@4da4d2b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:07:56,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 07:07:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:07:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:07:56,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:07:56,049 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:07:56,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:07:56,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:07:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1968190327, now seen corresponding path program 1 times [2024-11-09 07:07:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:07:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542942633] [2024-11-09 07:07:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:07:56,082 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 [2024-11-09 07:07:56,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:07:56,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 07:07:56,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:07:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:07:56,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 07:07:56,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:07:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:07:56,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:07:56,303 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:07:56,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542942633] [2024-11-09 07:07:56,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542942633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:07:56,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:07:56,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:07:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100556614] [2024-11-09 07:07:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:07:56,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:07:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:07:56,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:07:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:07:56,355 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:07:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:07:56,386 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2024-11-09 07:07:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:07:56,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-09 07:07:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:07:56,419 INFO L225 Difference]: With dead ends: 61 [2024-11-09 07:07:56,420 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 07:07:56,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:07:56,434 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:07:56,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:07:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 07:07:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 07:07:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:07:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-09 07:07:56,495 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2024-11-09 07:07:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:07:56,496 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-09 07:07:56,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:07:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-09 07:07:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:07:56,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:07:56,500 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:07:56,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 07:07:56,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:07:56,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:07:56,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:07:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash 537412023, now seen corresponding path program 1 times [2024-11-09 07:07:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:07:56,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380064480] [2024-11-09 07:07:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:07:56,706 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 [2024-11-09 07:07:56,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:07:56,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 07:07:56,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:07:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:07:56,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:07:56,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:07:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:07:57,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:07:57,869 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:07:57,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380064480] [2024-11-09 07:07:57,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380064480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:07:57,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:07:57,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:07:57,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893181431] [2024-11-09 07:07:57,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:07:57,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:07:57,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:07:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:07:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:07:57,879 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:08:00,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:02,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:04,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:06,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:08,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:11,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:13,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:16,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:18,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:20,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:22,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:24,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:26,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:28,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:30,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:32,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:34,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:36,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:38,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:40,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:42,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:08:42,387 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-11-09 07:08:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:08:42,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-09 07:08:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:08:42,391 INFO L225 Difference]: With dead ends: 71 [2024-11-09 07:08:42,392 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 07:08:42,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:08:42,394 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 17 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:08:42,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 171 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 136 Invalid, 21 Unknown, 0 Unchecked, 43.4s Time] [2024-11-09 07:08:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 07:08:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2024-11-09 07:08:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:08:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-09 07:08:42,413 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 23 [2024-11-09 07:08:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:08:42,414 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-09 07:08:42,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:08:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-09 07:08:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:08:42,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:08:42,416 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:42,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:08:42,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:08:42,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:08:42,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash 537471605, now seen corresponding path program 1 times [2024-11-09 07:08:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:08:42,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857361333] [2024-11-09 07:08:42,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:42,623 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 [2024-11-09 07:08:42,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:08:42,627 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 07:08:42,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:08:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:42,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:08:42,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:08:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:08:43,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:08:43,186 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:08:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857361333] [2024-11-09 07:08:43,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857361333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:43,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:43,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:08:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404229434] [2024-11-09 07:08:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:43,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:08:43,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:43,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:43,192 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:08:45,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:08:45,342 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2024-11-09 07:08:45,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:45,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-09 07:08:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:08:45,373 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:08:45,374 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 07:08:45,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:45,376 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:08:45,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 07:08:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 07:08:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-11-09 07:08:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 49 states have internal predecessors, (52), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:08:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-11-09 07:08:45,394 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 23 [2024-11-09 07:08:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:08:45,394 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-11-09 07:08:45,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:08:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-11-09 07:08:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 07:08:45,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:08:45,397 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:45,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:08:45,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:08:45,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:08:45,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash 470886851, now seen corresponding path program 1 times [2024-11-09 07:08:45,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:08:45,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016512084] [2024-11-09 07:08:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:45,605 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 [2024-11-09 07:08:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:08:45,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 07:08:45,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:08:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:45,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:08:45,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:08:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 07:08:46,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:08:46,595 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:08:46,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016512084] [2024-11-09 07:08:46,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016512084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:46,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:46,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:08:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727489777] [2024-11-09 07:08:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:46,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:08:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:08:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:08:46,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:08:46,599 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 07:08:50,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:52,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:54,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:56,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:58,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:09:02,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:09:04,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:09:06,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:09:08,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:09:10,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:09:12,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:09:14,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:09:14,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:09:14,326 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2024-11-09 07:09:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:09:14,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2024-11-09 07:09:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:09:14,329 INFO L225 Difference]: With dead ends: 84 [2024-11-09 07:09:14,329 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 07:09:14,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:09:14,331 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 49 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 22 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:09:14,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 242 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 160 Invalid, 12 Unknown, 0 Unchecked, 26.6s Time] [2024-11-09 07:09:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 07:09:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2024-11-09 07:09:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:09:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-11-09 07:09:14,354 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 53 [2024-11-09 07:09:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:09:14,355 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-09 07:09:14,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 07:09:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-09 07:09:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 07:09:14,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:09:14,358 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:09:14,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:09:14,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:09:14,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:09:14,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:09:14,562 INFO L85 PathProgramCache]: Analyzing trace with hash 470946433, now seen corresponding path program 1 times [2024-11-09 07:09:14,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:09:14,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240973553] [2024-11-09 07:09:14,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:09:14,563 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 [2024-11-09 07:09:14,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:09:14,567 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 07:09:14,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 07:09:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:09:15,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:09:15,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:09:26,745 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.geq ~Z~0 (fp.neg .cse0)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) ~Z~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) ~Z~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) ~Z~0)) c_~X~0) (fp.leq ~Z~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 07:10:13,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse5 (fp.neg .cse3)) (.cse6 (fp.neg .cse4)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0)))) (or (and (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse5)) (fp.geq ~Z~0 .cse6)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)))) (and (fp.leq ~Z~0 .cse4) (fp.leq .cse7 .cse3) (fp.geq .cse7 .cse5) (fp.geq ~Z~0 .cse6)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2024-11-09 07:10:32,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from false [2024-11-09 07:10:34,407 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from true [2024-11-09 07:10:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2024-11-09 07:10:34,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:10:44,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2024-11-09 07:10:46,907 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2024-11-09 07:10:57,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2024-11-09 07:10:59,152 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2024-11-09 07:13:39,505 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:14:10,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2024-11-09 07:14:12,787 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2024-11-09 07:14:37,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.neg .cse5)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_10| (_ FloatingPoint 8 24))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_10|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_10|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_10|)) (fp.neg .cse3)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse4)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_10| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse4)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse5)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_10|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_10|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_10|)) .cse3)))))) is different from false [2024-11-09 07:14:39,359 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.neg .cse5)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_10| (_ FloatingPoint 8 24))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_10|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_10|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_10|)) (fp.neg .cse3)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse4)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_10| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse4)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_10| .cse5)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_10|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_10|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_10|)) .cse3)))))) is different from true [2024-11-09 07:14:39,361 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:14:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240973553] [2024-11-09 07:14:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240973553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:14:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [186630710] [2024-11-09 07:14:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:14:39,362 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:14:39,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:14:39,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:14:39,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-09 07:14:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:14:41,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:14:41,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:42,448 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 (fp.neg .cse2)) (.cse4 (fp.neg .cse0))) (or (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)))) (and (fp.leq ~Z~0 .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3) (fp.geq ~Z~0 .cse4)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse2)) (fp.leq ~Z~0 .cse0) (fp.geq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse3)) (fp.geq ~Z~0 .cse4)))))))) is different from false [2024-11-09 07:16:09,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse5 (fp.neg .cse4))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4) (fp.geq ~Z~0 .cse5))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 .cse5)))))) is different from false [2024-11-09 07:16:11,018 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse5 (fp.neg .cse4))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4) (fp.geq ~Z~0 .cse5))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (fp.leq ~Z~0 .cse4) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 .cse5)))))) is different from true [2024-11-09 07:16:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2024-11-09 07:16:11,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:08,349 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from false [2024-11-09 07:18:10,373 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from true [2024-11-09 07:18:28,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq c_~X~0 .cse2)) (not (fp.geq c_~X~0 .cse1))))) is different from false [2024-11-09 07:18:30,834 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq c_~X~0 .cse2)) (not (fp.geq c_~X~0 .cse1))))) is different from true [2024-11-09 07:18:47,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_~I~0 .cse1)) (not (fp.leq c_~I~0 .cse2))))) is different from false [2024-11-09 07:18:49,842 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_~I~0 .cse1)) (not (fp.leq c_~I~0 .cse2))))) is different from true [2024-11-09 07:19:49,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse0 (fp.neg .cse2))) (or (not (fp.geq |c_ULTIMATE.start_main_#t~ret6#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.leq |c_ULTIMATE.start_main_#t~ret6#1| .cse2))))) is different from false [2024-11-09 07:19:51,485 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse0 (fp.neg .cse2))) (or (not (fp.geq |c_ULTIMATE.start_main_#t~ret6#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.leq |c_ULTIMATE.start_main_#t~ret6#1| .cse2))))) is different from true [2024-11-09 07:20:17,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 5.0)) (.cse4 (fp.neg .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_13| (_ FloatingPoint 8 24))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_13|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_13|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_13|)) (fp.neg .cse3)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_13| .cse4)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_13| .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_13| (_ FloatingPoint 8 24))) (or (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_13|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_13|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_13|)) .cse3) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_13| .cse4)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_13| .cse5))))))) is different from false [2024-11-09 07:20:19,430 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 5.0)) (.cse4 (fp.neg .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_13| (_ FloatingPoint 8 24))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_13|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_13|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_13|)) (fp.neg .cse3)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_13| .cse4)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_13| .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_13| (_ FloatingPoint 8 24))) (or (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_13|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_13|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_13|)) .cse3) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_13| .cse4)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_13| .cse5))))))) is different from true [2024-11-09 07:20:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [186630710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:20:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29796370] [2024-11-09 07:20:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:19,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:20:19,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:20:19,433 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:20:19,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cc73676-b8cb-4685-846a-0f6f7c4d56ac/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:20:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:44,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:20:44,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:21:30,724 WARN L851 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse5 (fp.neg .cse4))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4) (fp.geq ~Z~0 .cse5))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 .cse5))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2024-11-09 07:21:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2024-11-09 07:21:52,099 INFO L311 TraceCheckSpWp]: Computing backward predicates...