./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:19:35,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:19:35,352 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 16:19:35,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:19:35,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:19:35,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:19:35,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:19:35,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:19:35,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:19:35,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:19:35,385 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:19:35,385 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:19:35,386 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:19:35,386 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:19:35,387 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:19:35,387 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:19:35,387 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:19:35,388 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:19:35,388 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:19:35,389 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:19:35,389 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:19:35,390 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:19:35,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:19:35,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 16:19:35,392 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:19:35,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:19:35,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:19:35,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:19:35,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 16:19:35,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:19:35,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 16:19:35,395 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:19:35,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 16:19:35,396 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:19:35,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:19:35,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:19:35,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:19:35,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:19:35,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:19:35,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:19:35,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 16:19:35,399 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:19:35,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:19:35,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:19:35,399 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 16:19:35,399 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:19:35,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:19:35,400 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_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a [2023-12-02 16:19:35,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:19:35,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:19:35,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:19:35,643 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:19:35,644 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:19:35,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2023-12-02 16:19:38,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:19:38,562 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:19:38,562 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2023-12-02 16:19:38,570 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/data/84f67a51b/b5aa72b8d4774610ae38d7465f33af98/FLAG9eabede71 [2023-12-02 16:19:38,585 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/data/84f67a51b/b5aa72b8d4774610ae38d7465f33af98 [2023-12-02 16:19:38,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:19:38,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:19:38,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:19:38,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:19:38,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:19:38,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31727507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38, skipping insertion in model container [2023-12-02 16:19:38,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,619 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:19:38,763 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2023-12-02 16:19:38,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:19:38,786 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:19:38,797 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2023-12-02 16:19:38,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:19:38,815 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:19:38,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38 WrapperNode [2023-12-02 16:19:38,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:19:38,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:19:38,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:19:38,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:19:38,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,845 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2023-12-02 16:19:38,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:19:38,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:19:38,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:19:38,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:19:38,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:19:38,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:19:38,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:19:38,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:19:38,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (1/1) ... [2023-12-02 16:19:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:19:38,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:19:38,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:19:38,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:19:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:19:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 16:19:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:19:38,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:19:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 16:19:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 16:19:38,984 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:19:38,985 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:19:39,063 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:19:39,097 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:19:39,098 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 16:19:39,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:19:39 BoogieIcfgContainer [2023-12-02 16:19:39,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:19:39,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:19:39,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:19:39,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:19:39,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:19:38" (1/3) ... [2023-12-02 16:19:39,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7930eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:19:39, skipping insertion in model container [2023-12-02 16:19:39,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:38" (2/3) ... [2023-12-02 16:19:39,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7930eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:19:39, skipping insertion in model container [2023-12-02 16:19:39,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:19:39" (3/3) ... [2023-12-02 16:19:39,108 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2023-12-02 16:19:39,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:19:39,122 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 16:19:39,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:19:39,162 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f72f7ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:19:39,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 16:19:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 16:19:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 16:19:39,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:19:39,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 16:19:39,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 16:19:39,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:19:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1843522412, now seen corresponding path program 1 times [2023-12-02 16:19:39,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:19:39,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158893667] [2023-12-02 16:19:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:19:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:19:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 16:19:39,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 16:19:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 16:19:39,305 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 16:19:39,307 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 16:19:39,308 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 16:19:39,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 16:19:39,315 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 16:19:39,319 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 16:19:39,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:19:39 BoogieIcfgContainer [2023-12-02 16:19:39,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 16:19:39,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 16:19:39,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 16:19:39,345 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 16:19:39,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:19:39" (3/4) ... [2023-12-02 16:19:39,347 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 16:19:39,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 16:19:39,350 INFO L158 Benchmark]: Toolchain (without parser) took 760.48ms. Allocated memory is still 176.2MB. Free memory was 133.5MB in the beginning and 148.2MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:19:39,350 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:19:39,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.54ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 122.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 16:19:39,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.34ms. Allocated memory is still 176.2MB. Free memory was 122.7MB in the beginning and 121.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 16:19:39,352 INFO L158 Benchmark]: Boogie Preprocessor took 19.27ms. Allocated memory is still 176.2MB. Free memory was 121.5MB in the beginning and 120.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 16:19:39,353 INFO L158 Benchmark]: RCFGBuilder took 233.68ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 109.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 16:19:39,354 INFO L158 Benchmark]: TraceAbstraction took 242.27ms. Allocated memory is still 176.2MB. Free memory was 108.5MB in the beginning and 148.3MB in the end (delta: -39.8MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-12-02 16:19:39,354 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 176.2MB. Free memory was 148.3MB in the beginning and 148.2MB in the end (delta: 98.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:19:39,358 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.19ms. Allocated memory is still 109.1MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.54ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 122.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.34ms. Allocated memory is still 176.2MB. Free memory was 122.7MB in the beginning and 121.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.27ms. Allocated memory is still 176.2MB. Free memory was 121.5MB in the beginning and 120.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 233.68ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 109.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 242.27ms. Allocated memory is still 176.2MB. Free memory was 108.5MB in the beginning and 148.3MB in the end (delta: -39.8MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 176.2MB. Free memory was 148.3MB in the beginning and 148.2MB in the end (delta: 98.9kB). 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: 19]: 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 to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=20) [L14] COND FALSE !(!cond) [L28] RET assume_abort_if_not(a>=0 && a<=20) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, 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=13occurred 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, 6 NumberOfCodeBlocks, 6 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 [2023-12-02 16:19:39,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:19:41,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:19:41,400 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 16:19:41,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:19:41,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:19:41,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:19:41,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:19:41,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:19:41,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:19:41,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:19:41,438 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:19:41,438 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:19:41,439 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:19:41,439 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:19:41,440 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:19:41,440 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:19:41,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:19:41,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 16:19:41,442 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:19:41,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:19:41,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:19:41,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 16:19:41,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:19:41,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 16:19:41,446 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 16:19:41,446 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 16:19:41,446 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 16:19:41,447 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:19:41,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 16:19:41,448 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:19:41,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:19:41,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 16:19:41,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:19:41,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:19:41,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:19:41,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:19:41,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:19:41,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 16:19:41,450 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 16:19:41,450 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 16:19:41,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:19:41,451 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 16:19:41,451 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:19:41,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:19:41,452 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a [2023-12-02 16:19:41,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:19:41,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:19:41,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:19:41,800 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:19:41,800 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:19:41,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2023-12-02 16:19:44,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:19:44,739 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:19:44,739 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2023-12-02 16:19:44,745 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/data/2f1ad9b56/341c8371c6e54431916e6354910f002b/FLAG689a51103 [2023-12-02 16:19:44,757 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/data/2f1ad9b56/341c8371c6e54431916e6354910f002b [2023-12-02 16:19:44,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:19:44,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:19:44,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:19:44,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:19:44,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:19:44,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:44,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee63467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44, skipping insertion in model container [2023-12-02 16:19:44,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:44,785 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:19:44,907 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2023-12-02 16:19:44,920 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:19:44,933 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:19:44,943 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2023-12-02 16:19:44,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:19:44,963 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:19:44,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44 WrapperNode [2023-12-02 16:19:44,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:19:44,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:19:44,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:19:44,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:19:44,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:44,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:44,997 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-12-02 16:19:44,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:19:44,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:19:44,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:19:44,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:19:45,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:45,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:45,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:45,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:45,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:45,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:45,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:45,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:45,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:19:45,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:19:45,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:19:45,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:19:45,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (1/1) ... [2023-12-02 16:19:45,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:19:45,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:19:45,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:19:45,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:19:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:19:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 16:19:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:19:45,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:19:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 16:19:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 16:19:45,160 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:19:45,163 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:19:45,999 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:19:46,027 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:19:46,028 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 16:19:46,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:19:46 BoogieIcfgContainer [2023-12-02 16:19:46,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:19:46,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:19:46,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:19:46,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:19:46,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:19:44" (1/3) ... [2023-12-02 16:19:46,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eac9993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:19:46, skipping insertion in model container [2023-12-02 16:19:46,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:44" (2/3) ... [2023-12-02 16:19:46,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eac9993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:19:46, skipping insertion in model container [2023-12-02 16:19:46,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:19:46" (3/3) ... [2023-12-02 16:19:46,038 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2023-12-02 16:19:46,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:19:46,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 16:19:46,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:19:46,099 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4576829f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:19:46,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 16:19:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 16:19:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 16:19:46,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:19:46,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:19:46,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 16:19:46,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:19:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1892700911, now seen corresponding path program 1 times [2023-12-02 16:19:46,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:19:46,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437596245] [2023-12-02 16:19:46,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:19:46,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:19:46,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:19:46,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:19:46,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 16:19:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:19:46,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 16:19:46,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:19:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:19:46,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:19:46,532 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:19:46,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437596245] [2023-12-02 16:19:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437596245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:19:46,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:19:46,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:19:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547374890] [2023-12-02 16:19:46,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:19:46,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 16:19:46,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:19:46,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 16:19:46,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 16:19:46,599 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:19:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:19:46,628 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2023-12-02 16:19:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 16:19:46,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 16:19:46,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:19:46,638 INFO L225 Difference]: With dead ends: 28 [2023-12-02 16:19:46,638 INFO L226 Difference]: Without dead ends: 13 [2023-12-02 16:19:46,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 16:19:46,645 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:19:46,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:19:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-02 16:19:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-02 16:19:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 16:19:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-02 16:19:46,681 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2023-12-02 16:19:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:19:46,681 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-02 16:19:46,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:19:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-02 16:19:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 16:19:46,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:19:46,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:19:46,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 16:19:46,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:19:46,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 16:19:46,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:19:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash -115906089, now seen corresponding path program 1 times [2023-12-02 16:19:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:19:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879083324] [2023-12-02 16:19:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:19:46,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:19:46,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:19:46,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:19:46,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 16:19:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 16:19:47,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 16:19:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 16:19:47,562 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2023-12-02 16:19:47,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [315544241] [2023-12-02 16:19:47,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:19:47,562 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:19:47,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:19:47,585 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:19:47,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-02 16:19:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:19:48,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 16:19:48,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:20:15,354 WARN L854 $PredicateComparison]: unable to prove that (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2023-12-02 16:20:30,206 WARN L854 $PredicateComparison]: unable to prove that (or (= (_ bv1 32) c___VERIFIER_assert_~cond) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))))) is different from false [2023-12-02 16:20:46,030 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from false [2023-12-02 16:20:48,059 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from true [2023-12-02 16:20:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:20:48,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:20:48,060 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:20:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879083324] [2023-12-02 16:20:48,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 16:20:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [315544241] [2023-12-02 16:20:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [315544241] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:20:48,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:20:48,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 16:20:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988092731] [2023-12-02 16:20:48,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:20:48,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:20:48,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:20:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:20:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=14, Unknown=4, NotChecked=24, Total=56 [2023-12-02 16:20:48,064 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:20:49,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:20:52,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:20:54,068 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 [] [2023-12-02 16:20:56,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:20:57,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:20:58,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:21:01,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:21:02,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:21:04,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:21:06,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:21:08,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:21:11,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:21:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:11,544 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-12-02 16:21:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 16:21:11,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 16:21:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:11,600 INFO L225 Difference]: With dead ends: 21 [2023-12-02 16:21:11,600 INFO L226 Difference]: Without dead ends: 19 [2023-12-02 16:21:11,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=18, Invalid=20, Unknown=4, NotChecked=30, Total=72 [2023-12-02 16:21:11,602 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:11,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 34 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 8 Unknown, 68 Unchecked, 23.3s Time] [2023-12-02 16:21:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-02 16:21:11,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-02 16:21:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 16:21:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-12-02 16:21:11,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 8 [2023-12-02 16:21:11,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:11,611 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-12-02 16:21:11,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:21:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-12-02 16:21:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 16:21:11,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:11,613 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:21:11,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 16:21:11,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2023-12-02 16:21:12,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 16:21:12,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 16:21:12,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:12,015 INFO L85 PathProgramCache]: Analyzing trace with hash -981796939, now seen corresponding path program 1 times [2023-12-02 16:21:12,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:12,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101752570] [2023-12-02 16:21:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:12,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:21:12,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:12,017 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:21:12,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 16:21:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:12,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:21:12,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:18,587 WARN L854 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2023-12-02 16:21:20,643 WARN L876 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2023-12-02 16:21:33,006 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2023-12-02 16:21:41,265 WARN L854 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2023-12-02 16:21:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 16:21:41,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:02,132 WARN L293 SmtUtils]: Spent 12.55s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 16:22:14,689 WARN L293 SmtUtils]: Spent 12.56s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 16:22:20,899 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-02 16:22:31,246 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-02 16:22:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 16:22:31,249 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:22:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101752570] [2023-12-02 16:22:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101752570] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [693703444] [2023-12-02 16:22:31,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:22:31,250 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:22:31,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:22:31,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:22:31,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-02 16:22:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:22:31,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:22:31,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:47,888 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2023-12-02 16:22:56,146 WARN L854 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32)))) is different from false [2023-12-02 16:22:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 16:22:56,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:23:16,998 WARN L293 SmtUtils]: Spent 12.56s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 16:23:29,557 WARN L293 SmtUtils]: Spent 12.56s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 16:23:35,762 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-02 16:23:46,116 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-02 16:23:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 16:23:46,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [693703444] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:23:46,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119730280] [2023-12-02 16:23:46,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:23:46,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:23:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:23:46,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:23:46,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 16:23:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:23:46,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:23:46,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:24:02,950 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2023-12-02 16:24:11,220 WARN L854 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|)))))) is different from false [2023-12-02 16:24:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 16:24:11,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:24:32,138 WARN L293 SmtUtils]: Spent 12.60s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 16:24:44,726 WARN L293 SmtUtils]: Spent 12.59s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 16:24:50,947 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-02 16:25:01,309 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-02 16:25:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 16:25:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119730280] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:25:01,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 16:25:01,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2023-12-02 16:25:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020048306] [2023-12-02 16:25:01,312 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 16:25:01,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 16:25:01,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:25:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 16:25:01,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=25, Unknown=14, NotChecked=234, Total=306 [2023-12-02 16:25:01,315 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 16:25:03,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:25:05,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 16:25:07,746 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1 .cse2))) is different from true [2023-12-02 16:25:09,915 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1) .cse1)) is different from true [2023-12-02 16:25:12,088 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2023-12-02 16:25:14,280 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1 .cse2) (= (_ bv1 32) c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1 .cse2) (not .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1 .cse2) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))))) is different from false [2023-12-02 16:25:16,445 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1 .cse2) (= (_ bv1 32) c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1 .cse2) (not .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1 .cse2) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))))) is different from true [2023-12-02 16:25:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:16,446 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2023-12-02 16:25:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:25:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 14 [2023-12-02 16:25:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:16,448 INFO L225 Difference]: With dead ends: 21 [2023-12-02 16:25:16,448 INFO L226 Difference]: Without dead ends: 16 [2023-12-02 16:25:16,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=41, Invalid=28, Unknown=19, NotChecked=374, Total=462 [2023-12-02 16:25:16,450 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:16,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 2 Unknown, 187 Unchecked, 4.3s Time] [2023-12-02 16:25:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-02 16:25:16,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-02 16:25:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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) [2023-12-02 16:25:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-12-02 16:25:16,456 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2023-12-02 16:25:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:16,457 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-12-02 16:25:16,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 16:25:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-12-02 16:25:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 16:25:16,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:16,459 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:16,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 16:25:16,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-02 16:25:16,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 16:25:17,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:25:17,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 16:25:17,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:17,061 INFO L85 PathProgramCache]: Analyzing trace with hash -339209529, now seen corresponding path program 1 times [2023-12-02 16:25:17,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:25:17,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928134208] [2023-12-02 16:25:17,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:17,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:25:17,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:25:17,062 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:25:17,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 16:25:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 16:25:17,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 16:25:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 16:25:18,425 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2023-12-02 16:25:18,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2091498327] [2023-12-02 16:25:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:18,425 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:25:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:25:18,426 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:25:18,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-02 16:25:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:22,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 16:25:22,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:25:35,825 WARN L293 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:25:59,737 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (fp.gt .cse0 .cse1) (= (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-02 16:26:36,020 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse5))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4) (fp.gt .cse2 .cse3)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse5))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse6 .cse3)))) (_ bv0 32)) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4) (fp.gt .cse6 .cse3)))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) is different from false [2023-12-02 16:27:06,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse5))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32)) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4) (fp.gt .cse2 .cse3))))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse5))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse6 .cse3)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4) (fp.gt .cse6 .cse3)))) (= (_ bv0 32) c___VERIFIER_assert_~cond)))) is different from false [2023-12-02 16:27:22,443 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse1 .cse2)))) is different from false [2023-12-02 16:27:24,490 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse1 .cse2)))) is different from true [2023-12-02 16:27:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 16:27:24,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:27:31,090 WARN L854 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2023-12-02 16:27:33,151 WARN L876 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2023-12-02 16:27:47,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (_ bv0 32)) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) is different from false [2023-12-02 16:27:49,961 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (_ bv0 32)) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) is different from true [2023-12-02 16:28:17,481 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))))) is different from false [2023-12-02 16:28:19,544 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))))) is different from true [2023-12-02 16:28:34,343 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) is different from false [2023-12-02 16:28:36,408 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) is different from true [2023-12-02 16:28:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 16:28:36,409 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:28:36,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928134208] [2023-12-02 16:28:36,409 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 16:28:36,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2091498327] [2023-12-02 16:28:36,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2091498327] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:28:36,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131010281] [2023-12-02 16:28:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:36,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:28:36,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:28:36,411 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:28:36,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_270b29d3-8fa0-4bb6-b64c-92641fd679b2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process