./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:17:45,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:17:45,964 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:17:45,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:17:45,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:17:45,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:17:45,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:17:46,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:17:46,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:17:46,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:17:46,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:17:46,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:17:46,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:17:46,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:17:46,001 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:17:46,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:17:46,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:17:46,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:17:46,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:17:46,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:17:46,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:17:46,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:17:46,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:17:46,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:17:46,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:17:46,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:17:46,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:17:46,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:17:46,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:17:46,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:17:46,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:17:46,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:17:46,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:17:46,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:17:46,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:17:46,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:17:46,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:17:46,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:17:46,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:17:46,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:17:46,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:17:46,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:17:46,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:17:46,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:17:46,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:17:46,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:17:46,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:17:46,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:17:46,007 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer 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 -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2024-11-27 23:17:46,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:17:46,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:17:46,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:17:46,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:17:46,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:17:46,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-27 23:17:49,919 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data/4bb199b30/5761c18e357445209b1608a2f119f8c6/FLAGebb5ac1d4 [2024-11-27 23:17:50,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:17:50,216 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-27 23:17:50,225 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data/4bb199b30/5761c18e357445209b1608a2f119f8c6/FLAGebb5ac1d4 [2024-11-27 23:17:50,498 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data/4bb199b30/5761c18e357445209b1608a2f119f8c6 [2024-11-27 23:17:50,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:17:50,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:17:50,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:17:50,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:17:50,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:17:50,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513031f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50, skipping insertion in model container [2024-11-27 23:17:50,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:17:50,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-27 23:17:50,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:17:50,766 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:17:50,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-27 23:17:50,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:17:50,803 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:17:50,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50 WrapperNode [2024-11-27 23:17:50,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:17:50,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:17:50,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:17:50,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:17:50,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,835 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2024-11-27 23:17:50,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:17:50,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:17:50,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:17:50,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:17:50,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,858 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 23:17:50,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:17:50,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:17:50,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:17:50,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:17:50,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (1/1) ... [2024-11-27 23:17:50,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:17:50,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:50,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:17:50,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:17:50,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:17:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:17:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:17:50,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:17:51,052 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:17:51,055 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:17:51,286 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-27 23:17:51,286 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:17:51,298 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:17:51,299 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:17:51,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:17:51 BoogieIcfgContainer [2024-11-27 23:17:51,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:17:51,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:17:51,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:17:51,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:17:51,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:17:50" (1/3) ... [2024-11-27 23:17:51,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459703f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:17:51, skipping insertion in model container [2024-11-27 23:17:51,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:50" (2/3) ... [2024-11-27 23:17:51,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459703f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:17:51, skipping insertion in model container [2024-11-27 23:17:51,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:17:51" (3/3) ... [2024-11-27 23:17:51,313 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2024-11-27 23:17:51,333 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:17:51,335 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c.p+cfa-reducer.c that has 1 procedures, 24 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-27 23:17:51,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:17:51,421 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@4e845176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:17:51,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:17:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:17:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 23:17:51,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:51,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:51,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:51,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times [2024-11-27 23:17:51,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:51,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306111704] [2024-11-27 23:17:51,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:17:51,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:51,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306111704] [2024-11-27 23:17:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306111704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:17:51,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:17:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910298609] [2024-11-27 23:17:51,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:51,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:17:51,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:51,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:17:51,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:17:51,904 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:17:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:51,991 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2024-11-27 23:17:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:17:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-27 23:17:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:52,002 INFO L225 Difference]: With dead ends: 32 [2024-11-27 23:17:52,003 INFO L226 Difference]: Without dead ends: 24 [2024-11-27 23:17:52,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:17:52,010 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:52,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:17:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-27 23:17:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-27 23:17:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:17:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-27 23:17:52,053 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2024-11-27 23:17:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:52,053 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-27 23:17:52,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:17:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-27 23:17:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 23:17:52,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:52,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:52,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:17:52,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:52,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times [2024-11-27 23:17:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:52,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279403662] [2024-11-27 23:17:52,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:52,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:17:52,077 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:17:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:17:52,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:17:52,113 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:17:52,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:17:52,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:17:52,124 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-27 23:17:52,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:17:52,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:17:52 BoogieIcfgContainer [2024-11-27 23:17:52,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:17:52,162 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:17:52,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:17:52,163 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:17:52,163 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:17:51" (3/4) ... [2024-11-27 23:17:52,166 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 23:17:52,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:17:52,170 INFO L158 Benchmark]: Toolchain (without parser) took 1666.42ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 42.3MB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-27 23:17:52,171 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:17:52,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.17ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 80.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:17:52,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.21ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:17:52,178 INFO L158 Benchmark]: Boogie Preprocessor took 36.20ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:17:52,178 INFO L158 Benchmark]: RCFGBuilder took 427.03ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 68.2MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:17:52,179 INFO L158 Benchmark]: TraceAbstraction took 858.65ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 42.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 23:17:52,179 INFO L158 Benchmark]: Witness Printer took 6.44ms. Allocated memory is still 117.4MB. Free memory was 42.5MB in the beginning and 42.3MB in the end (delta: 196.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:17:52,182 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.48ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.17ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 80.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.21ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.20ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 427.03ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 68.2MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 858.65ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 42.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 6.44ms. Allocated memory is still 117.4MB. Free memory was 42.5MB in the beginning and 42.3MB in the end (delta: 196.0kB). 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: 66]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 20, overapproximation of someBinaryArithmeticFLOAToperation at line 47, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] float main__X; [L15] float main__Y; [L16] float main__S; [L17] float main__R; [L18] float main__D; [L19] int main__i; [L20] main__Y = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i < 100000 [L25] main__X = __VERIFIER_nondet_float() [L26] main__D = __VERIFIER_nondet_float() [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=0] [L28] COND TRUE main__X >= -128.0 VAL [__return_main=0, main__i=0] [L30] COND TRUE main__X <= 128.0 [L32] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0] [L34] COND TRUE main____CPAchecker_TMP_0 != 0 [L36] int main____CPAchecker_TMP_1; VAL [__return_main=0, main__i=0] [L37] COND TRUE main__D >= 0.0 VAL [__return_main=0, main__i=0] [L39] COND TRUE main__D <= 16.0 [L41] main____CPAchecker_TMP_1 = 1 VAL [__return_main=0, main____CPAchecker_TMP_1=1, main__i=0] [L43] COND TRUE main____CPAchecker_TMP_1 != 0 [L45] main__S = main__Y [L46] main__Y = main__X [L47] main__R = main__X - main__S VAL [__return_main=0, main__Y=54, main__i=0] [L48] COND TRUE main__R <= (-main__D) [L50] main__Y = main__S - main__D VAL [__return_main=0, main__i=0] [L52] int main____CPAchecker_TMP_2; VAL [__return_main=0, main__i=0] [L53] COND FALSE !(main__Y >= -129.0) VAL [__return_main=0, main__i=0] [L79] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_2=0, main__i=0] [L60] int __tmp_1; [L61] __tmp_1 = main____CPAchecker_TMP_2 [L62] int __VERIFIER_assert__cond; [L63] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__i=0] [L64] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0] [L66] reach_error() VAL [__return_main=0, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 31 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 23:17:52,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:17:55,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:17:55,186 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 23:17:55,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:17:55,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:17:55,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:17:55,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:17:55,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:17:55,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:17:55,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:17:55,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:17:55,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:17:55,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:17:55,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:17:55,246 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:17:55,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:17:55,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:17:55,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:17:55,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:17:55,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:17:55,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:17:55,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:17:55,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:17:55,247 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:17:55,247 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 23:17:55,247 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 23:17:55,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:17:55,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:17:55,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:17:55,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:17:55,248 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:17:55,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:17:55,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:17:55,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:17:55,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:17:55,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:17:55,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:17:55,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:17:55,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:17:55,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:17:55,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:17:55,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:17:55,253 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:17:55,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:17:55,253 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 23:17:55,254 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 23:17:55,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:17:55,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:17:55,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:17:55,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:17:55,254 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer 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 -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2024-11-27 23:17:55,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:17:55,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:17:55,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:17:55,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:17:55,634 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:17:55,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-27 23:17:59,223 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data/22d196fcf/6df1eead9c284e08805fc9b5a2b94a51/FLAGf67c0ef17 [2024-11-27 23:17:59,501 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:17:59,502 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-27 23:17:59,522 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data/22d196fcf/6df1eead9c284e08805fc9b5a2b94a51/FLAGf67c0ef17 [2024-11-27 23:17:59,551 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/data/22d196fcf/6df1eead9c284e08805fc9b5a2b94a51 [2024-11-27 23:17:59,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:17:59,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:17:59,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:17:59,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:17:59,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:17:59,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6c45b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59, skipping insertion in model container [2024-11-27 23:17:59,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:17:59,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-27 23:17:59,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:17:59,811 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:17:59,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-27 23:17:59,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:17:59,853 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:17:59,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59 WrapperNode [2024-11-27 23:17:59,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:17:59,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:17:59,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:17:59,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:17:59,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,891 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-11-27 23:17:59,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:17:59,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:17:59,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:17:59,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:17:59,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,917 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 23:17:59,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:17:59,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:17:59,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:17:59,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:17:59,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (1/1) ... [2024-11-27 23:17:59,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:17:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:59,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:17:59,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:18:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:18:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 23:18:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:18:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:18:00,113 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:18:00,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:18:01,280 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-27 23:18:01,281 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:18:01,289 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:18:01,289 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:18:01,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:18:01 BoogieIcfgContainer [2024-11-27 23:18:01,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:18:01,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:18:01,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:18:01,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:18:01,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:17:59" (1/3) ... [2024-11-27 23:18:01,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3380decc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:18:01, skipping insertion in model container [2024-11-27 23:18:01,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:17:59" (2/3) ... [2024-11-27 23:18:01,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3380decc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:18:01, skipping insertion in model container [2024-11-27 23:18:01,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:18:01" (3/3) ... [2024-11-27 23:18:01,302 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2024-11-27 23:18:01,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:18:01,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c.p+cfa-reducer.c that has 1 procedures, 24 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-27 23:18:01,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:18:01,379 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@571e3674, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:18:01,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:18:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:18:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 23:18:01,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:18:01,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:18:01,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:18:01,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:18:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times [2024-11-27 23:18:01,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:18:01,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899046058] [2024-11-27 23:18:01,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:01,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:18:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:18:01,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:18:01,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-27 23:18:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:01,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 23:18:01,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:18:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:18:01,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:18:01,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:18:01,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899046058] [2024-11-27 23:18:01,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899046058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:18:01,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:18:01,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:18:01,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915637794] [2024-11-27 23:18:01,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:18:01,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:18:01,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:18:01,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:18:01,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:18:01,724 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:18:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:18:01,779 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2024-11-27 23:18:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:18:01,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-27 23:18:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:18:01,788 INFO L225 Difference]: With dead ends: 31 [2024-11-27 23:18:01,789 INFO L226 Difference]: Without dead ends: 23 [2024-11-27 23:18:01,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:18:01,798 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:18:01,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:18:01,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-27 23:18:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-27 23:18:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:18:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-27 23:18:01,832 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2024-11-27 23:18:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:18:01,833 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-27 23:18:01,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:18:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-27 23:18:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 23:18:01,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:18:01,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:18:01,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:18:02,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:18:02,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:18:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:18:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times [2024-11-27 23:18:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:18:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980495785] [2024-11-27 23:18:02,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:02,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:18:02,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:18:02,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:18:02,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-27 23:18:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:02,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 23:18:02,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:18:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:18:13,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:18:13,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:18:13,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980495785] [2024-11-27 23:18:13,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980495785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:18:13,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:18:13,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:18:13,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969426456] [2024-11-27 23:18:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:18:13,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:18:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:18:13,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:18:13,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:18:13,103 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:18:17,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:23,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:28,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:32,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:36,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:43,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:46,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:51,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:55,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:00,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:00,474 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2024-11-27 23:19:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:19:00,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-27 23:19:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:00,483 INFO L225 Difference]: With dead ends: 75 [2024-11-27 23:19:00,483 INFO L226 Difference]: Without dead ends: 54 [2024-11-27 23:19:00,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:19:00,484 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:00,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 52 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 6 Unknown, 0 Unchecked, 47.3s Time] [2024-11-27 23:19:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-27 23:19:00,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2024-11-27 23:19:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2024-11-27 23:19:00,492 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 16 [2024-11-27 23:19:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:00,492 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2024-11-27 23:19:00,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2024-11-27 23:19:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 23:19:00,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:00,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:00,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-27 23:19:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:19:00,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:19:00,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:00,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1271663018, now seen corresponding path program 1 times [2024-11-27 23:19:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:19:00,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601315249] [2024-11-27 23:19:00,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:00,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:19:00,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:19:00,697 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:19:00,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-27 23:19:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:00,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 23:19:00,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:00,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:19:00,822 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:19:00,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601315249] [2024-11-27 23:19:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601315249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:19:00,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107215319] [2024-11-27 23:19:00,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:00,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:00,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:19:00,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:00,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:00,825 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:00,928 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-27 23:19:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:00,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-27 23:19:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:00,933 INFO L225 Difference]: With dead ends: 56 [2024-11-27 23:19:00,933 INFO L226 Difference]: Without dead ends: 33 [2024-11-27 23:19:00,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:00,934 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:00,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:19:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-27 23:19:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-27 23:19:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-27 23:19:00,941 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 16 [2024-11-27 23:19:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:00,941 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-27 23:19:00,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-27 23:19:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 23:19:00,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:00,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:00,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-27 23:19:01,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:19:01,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:19:01,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:01,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1069421883, now seen corresponding path program 1 times [2024-11-27 23:19:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:19:01,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048017544] [2024-11-27 23:19:01,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:01,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:19:01,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:19:01,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:19:01,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-27 23:19:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:01,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 23:19:01,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:05,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:19:05,015 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:19:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048017544] [2024-11-27 23:19:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048017544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:05,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:19:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395488060] [2024-11-27 23:19:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:05,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:19:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:19:05,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:19:05,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:19:05,016 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:17,697 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-11-27 23:19:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:19:17,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-27 23:19:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:17,705 INFO L225 Difference]: With dead ends: 72 [2024-11-27 23:19:17,705 INFO L226 Difference]: Without dead ends: 52 [2024-11-27 23:19:17,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:19:17,706 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:17,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 62 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-27 23:19:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-27 23:19:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2024-11-27 23:19:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-27 23:19:17,712 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 17 [2024-11-27 23:19:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:17,712 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-27 23:19:17,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-27 23:19:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 23:19:17,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:17,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:17,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:19:17,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:19:17,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:19:17,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:17,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1450538051, now seen corresponding path program 1 times [2024-11-27 23:19:17,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:19:17,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34702694] [2024-11-27 23:19:17,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:17,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:19:17,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:19:17,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:19:17,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-27 23:19:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:17,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 23:19:17,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:21,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:19:21,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:19:21,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34702694] [2024-11-27 23:19:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34702694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:21,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:21,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:19:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463084079] [2024-11-27 23:19:21,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:21,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:19:21,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:19:21,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:19:21,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:19:21,757 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:41,482 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2024-11-27 23:19:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:19:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-27 23:19:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:41,496 INFO L225 Difference]: With dead ends: 98 [2024-11-27 23:19:41,496 INFO L226 Difference]: Without dead ends: 78 [2024-11-27 23:19:41,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:19:41,497 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:41,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2024-11-27 23:19:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-27 23:19:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2024-11-27 23:19:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-27 23:19:41,503 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2024-11-27 23:19:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:41,504 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-27 23:19:41,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-27 23:19:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 23:19:41,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:41,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:41,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-27 23:19:41,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:19:41,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:19:41,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1069229389, now seen corresponding path program 1 times [2024-11-27 23:19:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:19:41,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482925338] [2024-11-27 23:19:41,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:41,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:19:41,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:19:41,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:19:41,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-27 23:19:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:41,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 23:19:41,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:52,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:19:52,630 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:19:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482925338] [2024-11-27 23:19:52,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482925338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:52,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:52,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:19:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533063275] [2024-11-27 23:19:52,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:52,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:19:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:19:52,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:19:52,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:19:52,634 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:20:05,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:20:06,954 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2024-11-27 23:20:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:20:06,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-27 23:20:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:20:06,958 INFO L225 Difference]: With dead ends: 95 [2024-11-27 23:20:06,959 INFO L226 Difference]: Without dead ends: 66 [2024-11-27 23:20:06,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:20:06,960 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:20:06,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 40 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2024-11-27 23:20:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-27 23:20:06,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2024-11-27 23:20:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:20:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-27 23:20:06,965 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2024-11-27 23:20:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:20:06,966 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-27 23:20:06,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:20:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-27 23:20:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 23:20:06,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:20:06,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:20:06,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-27 23:20:07,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:20:07,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:20:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:20:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1175383176, now seen corresponding path program 1 times [2024-11-27 23:20:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:20:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588676783] [2024-11-27 23:20:07,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:20:07,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:20:07,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:20:07,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:20:07,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:20:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:20:07,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 23:20:07,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:20:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:20:07,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:20:07,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:20:07,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588676783] [2024-11-27 23:20:07,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588676783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:20:07,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:20:07,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:20:07,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545016147] [2024-11-27 23:20:07,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:20:07,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:20:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:20:07,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:20:07,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:20:07,286 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:20:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:20:07,426 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2024-11-27 23:20:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:20:07,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-27 23:20:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:20:07,428 INFO L225 Difference]: With dead ends: 75 [2024-11-27 23:20:07,428 INFO L226 Difference]: Without dead ends: 35 [2024-11-27 23:20:07,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:20:07,429 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:20:07,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:20:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-27 23:20:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-27 23:20:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:20:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-27 23:20:07,434 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2024-11-27 23:20:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:20:07,434 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-27 23:20:07,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:20:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-27 23:20:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-27 23:20:07,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:20:07,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:20:07,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/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)] Forceful destruction successful, exit code 0 [2024-11-27 23:20:07,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:20:07,636 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:20:07,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:20:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1724506925, now seen corresponding path program 1 times [2024-11-27 23:20:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:20:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930958120] [2024-11-27 23:20:07,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:20:07,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:20:07,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:20:07,639 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:20:07,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-27 23:20:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:20:07,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 23:20:07,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:20:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:20:14,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:20:14,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:20:14,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930958120] [2024-11-27 23:20:14,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930958120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:20:14,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:20:14,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:20:14,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117671973] [2024-11-27 23:20:14,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:20:14,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:20:14,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:20:14,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:20:14,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:20:14,305 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:20:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:20:25,529 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-11-27 23:20:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:20:25,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-27 23:20:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:20:25,534 INFO L225 Difference]: With dead ends: 67 [2024-11-27 23:20:25,534 INFO L226 Difference]: Without dead ends: 45 [2024-11-27 23:20:25,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:20:25,535 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:20:25,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2024-11-27 23:20:25,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-27 23:20:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2024-11-27 23:20:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:20:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-27 23:20:25,539 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 18 [2024-11-27 23:20:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:20:25,539 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-27 23:20:25,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:20:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-27 23:20:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 23:20:25,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:20:25,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:20:25,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-27 23:20:25,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:20:25,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:20:25,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:20:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash -66815887, now seen corresponding path program 1 times [2024-11-27 23:20:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:20:25,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986416893] [2024-11-27 23:20:25,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:20:25,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 23:20:25,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:20:25,743 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 23:20:25,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21598b8a-69e1-4410-8431-69ddb218e8f2/bin/uautomizer-verify-aQ6SnzHsRB/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 (10)] Waiting until timeout for monitored process [2024-11-27 23:20:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:20:25,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 23:20:25,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:22:03,203 WARN L286 SmtUtils]: Spent 11.42s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:22:23,520 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:30,445 WARN L286 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:38,521 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:45,745 WARN L286 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:53,503 WARN L286 SmtUtils]: Spent 7.76s on a formula simplification. DAG size of input: 9 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:01,564 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:07,576 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:11,592 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_13| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__R~0#1_14| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_17| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_18| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_18|)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 16.0))) (and (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_13| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_17|)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_17|) |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_14| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_17|) .cse0) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq .cse1 .cse0)))) is different from false [2024-11-27 23:23:15,605 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_13| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__R~0#1_14| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_17| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_18| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_18|)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 16.0))) (and (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_13| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_17|)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_17|) |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_14| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_17|) .cse0) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq .cse1 .cse0)))) is different from true [2024-11-27 23:23:27,683 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:32,752 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:40,808 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:46,255 WARN L286 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:53,588 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 5 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:02,575 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_13| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__R~0#1_14| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_17| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_18| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 16.0))) (and (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_13| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_17|)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_17|) |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_14| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_17|) .cse0) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_18|) .cse0)))) is different from false [2024-11-27 23:24:06,588 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_13| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__R~0#1_14| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_17| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_18| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 16.0))) (and (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_13| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_17|)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_17|) |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_14| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_17|) .cse0) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_18|) .cse0)))) is different from true [2024-11-27 23:24:18,749 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:23,952 WARN L286 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:32,013 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:37,245 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:54,030 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:59,609 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:25:07,667 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:25:17,771 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:25:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-27 23:25:17,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:28:01,327 WARN L286 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:29:03,862 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:08,875 WARN L286 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:16,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|))))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|) .cse1)))) is different from false [2024-11-27 23:29:26,169 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:34,241 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:39,504 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:46,928 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (let ((.cse1 (fp.neg .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) .cse1) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|))))))) (not (fp.geq .cse2 .cse1)) (not (fp.leq .cse2 .cse3))))) is different from true [2024-11-27 23:29:52,478 WARN L286 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:00,543 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:09,308 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:20,312 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:28,336 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:36,425 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:44,436 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:30:52,806 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__S~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (forall ((|v_ULTIMATE.start_main_~main__R~0#1_16| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_20| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_20|))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_16| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_20|))) (not (fp.geq .cse3 (_ +zero 11 53))) (not (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~main__D~0#1_20|)) .cse2)))) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2024-11-27 23:31:00,930 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:06,391 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:14,480 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:20,465 WARN L286 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:27,118 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse4))) (or (forall ((|v_ULTIMATE.start_main_~main__R~0#1_16| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_20| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_20|))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_16| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_20|))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_20|)) .cse1) (not (fp.geq .cse2 (_ +zero 11 53))) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0)))))) (not (fp.leq .cse3 .cse4)) (not (fp.geq .cse3 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2024-11-27 23:31:35,257 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:43,047 WARN L286 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:51,146 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:31:58,715 WARN L286 SmtUtils]: Spent 7.57s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:10,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__R~0#1_16| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_20| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_20|))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_16| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_20|))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_20|)) .cse3) (not (fp.geq .cse4 (_ +zero 11 53))) (not (fp.leq .cse4 .cse5))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|) .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) is different from false [2024-11-27 23:32:14,351 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__R~0#1_16| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_20| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_20|))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_16| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_20|))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_20|)) .cse3) (not (fp.geq .cse4 (_ +zero 11 53))) (not (fp.leq .cse4 .cse5))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|) .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) is different from true [2024-11-27 23:32:22,472 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:30,563 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:38,651 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:32:46,736 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:02,381 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:10,298 WARN L286 SmtUtils]: Spent 7.92s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:18,385 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)