./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/drift_tenth.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_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1 --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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 13:07:55,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 13:07:55,597 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 13:07:55,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 13:07:55,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 13:07:55,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 13:07:55,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 13:07:55,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 13:07:55,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 13:07:55,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 13:07:55,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 13:07:55,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 13:07:55,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 13:07:55,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 13:07:55,630 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 13:07:55,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 13:07:55,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 13:07:55,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 13:07:55,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 13:07:55,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 13:07:55,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 13:07:55,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 13:07:55,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 13:07:55,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 13:07:55,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 13:07:55,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 13:07:55,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 13:07:55,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 13:07:55,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 13:07:55,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:07:55,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:07:55,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:07:55,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:07:55,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 13:07:55,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:07:55,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:07:55,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:07:55,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:07:55,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 13:07:55,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 13:07:55,633 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 13:07:55,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 13:07:55,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 13:07:55,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 13:07:55,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 13:07:55,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 13:07:55,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 13:07:55,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 13:07:55,634 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_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2024-12-02 13:07:55,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 13:07:55,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 13:07:55,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 13:07:55,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 13:07:55,873 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 13:07:55,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/float-benchs/drift_tenth.c [2024-12-02 13:07:58,472 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data/0e19d9c66/03bd76df91d34ae0bccf20342520ac35/FLAGfadeb0d15 [2024-12-02 13:07:58,682 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 13:07:58,682 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/sv-benchmarks/c/float-benchs/drift_tenth.c [2024-12-02 13:07:58,690 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data/0e19d9c66/03bd76df91d34ae0bccf20342520ac35/FLAGfadeb0d15 [2024-12-02 13:07:59,057 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data/0e19d9c66/03bd76df91d34ae0bccf20342520ac35 [2024-12-02 13:07:59,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 13:07:59,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 13:07:59,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 13:07:59,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 13:07:59,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 13:07:59,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d4ee81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59, skipping insertion in model container [2024-12-02 13:07:59,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 13:07:59,175 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_23c0cbbc-f9cb-4b67-b027-a704c91b3150/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2024-12-02 13:07:59,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:07:59,192 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 13:07:59,200 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_23c0cbbc-f9cb-4b67-b027-a704c91b3150/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2024-12-02 13:07:59,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:07:59,214 INFO L204 MainTranslator]: Completed translation [2024-12-02 13:07:59,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59 WrapperNode [2024-12-02 13:07:59,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 13:07:59,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 13:07:59,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 13:07:59,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 13:07:59,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,239 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 29 [2024-12-02 13:07:59,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 13:07:59,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 13:07:59,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 13:07:59,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 13:07:59,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,256 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-12-02 13:07:59,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 13:07:59,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 13:07:59,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 13:07:59,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 13:07:59,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (1/1) ... [2024-12-02 13:07:59,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:07:59,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:07:59,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 13:07:59,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 13:07:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 13:07:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 13:07:59,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 13:07:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 13:07:59,361 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 13:07:59,362 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 13:07:59,438 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-12-02 13:07:59,438 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 13:07:59,446 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 13:07:59,446 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 13:07:59,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:07:59 BoogieIcfgContainer [2024-12-02 13:07:59,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 13:07:59,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 13:07:59,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 13:07:59,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 13:07:59,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:07:59" (1/3) ... [2024-12-02 13:07:59,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441e039c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:07:59, skipping insertion in model container [2024-12-02 13:07:59,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:07:59" (2/3) ... [2024-12-02 13:07:59,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441e039c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:07:59, skipping insertion in model container [2024-12-02 13:07:59,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:07:59" (3/3) ... [2024-12-02 13:07:59,454 INFO L128 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2024-12-02 13:07:59,465 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 13:07:59,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG drift_tenth.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 13:07:59,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 13:07:59,519 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;@7a89ca1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 13:07:59,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 13:07:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:07:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 13:07:59,527 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:07:59,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 13:07:59,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:07:59,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:07:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times [2024-12-02 13:07:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:07:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118114384] [2024-12-02 13:07:59,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:07:59,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:07:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:07:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:07:59,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:07:59,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118114384] [2024-12-02 13:07:59,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118114384] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:07:59,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:07:59,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:07:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736461422] [2024-12-02 13:07:59,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:07:59,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:07:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:07:59,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:07:59,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:07:59,689 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-02 13:07:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:07:59,708 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-12-02 13:07:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:07:59,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-12-02 13:07:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:07:59,715 INFO L225 Difference]: With dead ends: 22 [2024-12-02 13:07:59,715 INFO L226 Difference]: Without dead ends: 10 [2024-12-02 13:07:59,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:07:59,720 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:07:59,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:07:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-12-02 13:07:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-12-02 13:07:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:07:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-12-02 13:07:59,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-12-02 13:07:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:07:59,742 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-12-02 13:07:59,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-02 13:07:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-12-02 13:07:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-02 13:07:59,742 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:07:59,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:07:59,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 13:07:59,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:07:59,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:07:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 207982255, now seen corresponding path program 1 times [2024-12-02 13:07:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:07:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965528970] [2024-12-02 13:07:59,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:07:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:07:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:07:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:07:59,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:07:59,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965528970] [2024-12-02 13:07:59,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965528970] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:07:59,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504818622] [2024-12-02 13:07:59,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:07:59,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:07:59,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:07:59,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:07:59,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 13:07:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:07:59,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 13:07:59,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:07:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:07:59,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:07:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:07:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504818622] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:07:59,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:07:59,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-12-02 13:07:59,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537112820] [2024-12-02 13:07:59,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:07:59,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 13:07:59,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:07:59,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 13:07:59,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:07:59,920 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-12-02 13:07:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:07:59,952 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-12-02 13:07:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:07:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 8 [2024-12-02 13:07:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:07:59,953 INFO L225 Difference]: With dead ends: 19 [2024-12-02 13:07:59,953 INFO L226 Difference]: Without dead ends: 15 [2024-12-02 13:07:59,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:07:59,954 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:07:59,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:07:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-12-02 13:07:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-12-02 13:07:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-12-02 13:07:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-12-02 13:07:59,958 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-12-02 13:07:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:07:59,959 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-12-02 13:07:59,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-12-02 13:07:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-12-02 13:07:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 13:07:59,959 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:07:59,959 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-12-02 13:07:59,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 13:08:00,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:08:00,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:08:00,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:08:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash -858744965, now seen corresponding path program 2 times [2024-12-02 13:08:00,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:08:00,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116313004] [2024-12-02 13:08:00,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 13:08:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:08:00,179 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 13:08:00,179 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:08:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:08:00,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:08:00,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116313004] [2024-12-02 13:08:00,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116313004] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:08:00,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703382222] [2024-12-02 13:08:00,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 13:08:00,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:08:00,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:08:00,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:08:00,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 13:08:00,321 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 13:08:00,322 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:08:00,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 13:08:00,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:08:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:08:00,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:08:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:08:00,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703382222] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:08:00,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:08:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-12-02 13:08:00,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550835992] [2024-12-02 13:08:00,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:08:00,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 13:08:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:08:00,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 13:08:00,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-12-02 13:08:00,446 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-12-02 13:08:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:08:00,489 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-12-02 13:08:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 13:08:00,489 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 14 [2024-12-02 13:08:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:08:00,490 INFO L225 Difference]: With dead ends: 31 [2024-12-02 13:08:00,490 INFO L226 Difference]: Without dead ends: 27 [2024-12-02 13:08:00,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-12-02 13:08:00,491 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:08:00,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:08:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-12-02 13:08:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-12-02 13:08:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-12-02 13:08:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-12-02 13:08:00,496 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-12-02 13:08:00,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:08:00,496 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-12-02 13:08:00,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-12-02 13:08:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-12-02 13:08:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 13:08:00,497 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:08:00,497 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-12-02 13:08:00,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 13:08:00,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:08:00,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:08:00,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:08:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1255476755, now seen corresponding path program 3 times [2024-12-02 13:08:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:08:00,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545998255] [2024-12-02 13:08:00,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 13:08:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:08:00,716 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-12-02 13:08:00,716 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 13:08:00,716 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 13:08:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 13:08:00,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 13:08:00,741 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 13:08:00,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 13:08:00,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 13:08:00,746 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2024-12-02 13:08:00,763 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 13:08:00,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:08:00 BoogieIcfgContainer [2024-12-02 13:08:00,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 13:08:00,767 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 13:08:00,767 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 13:08:00,767 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 13:08:00,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:07:59" (3/4) ... [2024-12-02 13:08:00,770 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 13:08:00,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 13:08:00,771 INFO L158 Benchmark]: Toolchain (without parser) took 1711.22ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 104.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-12-02 13:08:00,771 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:08:00,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.72ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 106.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 13:08:00,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.36ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 105.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:08:00,772 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 104.3MB in the end (delta: 989.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 13:08:00,773 INFO L158 Benchmark]: RCFGBuilder took 181.44ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 94.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 13:08:00,773 INFO L158 Benchmark]: TraceAbstraction took 1318.09ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 104.7MB in the end (delta: -10.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:08:00,773 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 104.6MB in the end (delta: 15.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:08:00,775 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.33ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.72ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 106.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.36ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 105.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 104.3MB in the end (delta: 989.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 181.44ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 94.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1318.09ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 104.7MB in the end (delta: -10.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 104.6MB in the end (delta: 15.8kB). 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: 6]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 10, overapproximation of someBinaryArithmeticFLOAToperation at line 15. Possible FailurePath: [L10] float tick = 1.f / 10.f; [L11] float time = 0.f; [L12] int i; [L14] i = 0 VAL [i=0] [L14] COND TRUE i < 10 VAL [i=0] [L15] time += tick [L14] i++ VAL [i=1] [L14] COND TRUE i < 10 VAL [i=1] [L15] time += tick [L14] i++ VAL [i=2] [L14] COND TRUE i < 10 VAL [i=2] [L15] time += tick [L14] i++ VAL [i=3] [L14] COND TRUE i < 10 VAL [i=3] [L15] time += tick [L14] i++ VAL [i=4] [L14] COND TRUE i < 10 VAL [i=4] [L15] time += tick [L14] i++ VAL [i=5] [L14] COND TRUE i < 10 VAL [i=5] [L15] time += tick [L14] i++ VAL [i=6] [L14] COND TRUE i < 10 VAL [i=6] [L15] time += tick [L14] i++ VAL [i=7] [L14] COND TRUE i < 10 VAL [i=7] [L15] time += tick [L14] i++ VAL [i=8] [L14] COND TRUE i < 10 VAL [i=8] [L15] time += tick [L14] i++ VAL [i=9] [L14] COND TRUE i < 10 VAL [i=9] [L15] time += tick [L14] i++ VAL [i=10] [L14] COND FALSE !(i < 10) [L17] CALL __VERIFIER_assert(time != 1.0) [L6] COND TRUE !(cond) [L6] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 22 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/51 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-12-02 13:08:00,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1 --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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 13:08:02,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 13:08:02,844 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-12-02 13:08:02,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 13:08:02,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 13:08:02,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 13:08:02,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 13:08:02,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 13:08:02,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 13:08:02,870 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 13:08:02,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 13:08:02,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 13:08:02,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 13:08:02,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 13:08:02,870 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 13:08:02,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 13:08:02,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 13:08:02,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 13:08:02,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 13:08:02,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 13:08:02,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 13:08:02,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:08:02,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:08:02,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:08:02,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:08:02,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 13:08:02,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:08:02,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:08:02,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:08:02,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:08:02,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 13:08:02,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 13:08:02,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 13:08:02,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 13:08:02,873 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 13:08:02,874 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 13:08:02,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 13:08:02,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 13:08:02,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 13:08:02,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 13:08:02,874 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_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2024-12-02 13:08:03,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 13:08:03,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 13:08:03,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 13:08:03,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 13:08:03,124 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 13:08:03,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/float-benchs/drift_tenth.c [2024-12-02 13:08:05,873 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data/f675d8cd3/cfd2536e039945e69f4946e4ac4c719f/FLAG06bd769b1 [2024-12-02 13:08:06,025 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 13:08:06,025 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/sv-benchmarks/c/float-benchs/drift_tenth.c [2024-12-02 13:08:06,031 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data/f675d8cd3/cfd2536e039945e69f4946e4ac4c719f/FLAG06bd769b1 [2024-12-02 13:08:06,043 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/data/f675d8cd3/cfd2536e039945e69f4946e4ac4c719f [2024-12-02 13:08:06,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 13:08:06,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 13:08:06,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 13:08:06,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 13:08:06,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 13:08:06,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edf73a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06, skipping insertion in model container [2024-12-02 13:08:06,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 13:08:06,162 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_23c0cbbc-f9cb-4b67-b027-a704c91b3150/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2024-12-02 13:08:06,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:08:06,183 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 13:08:06,191 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_23c0cbbc-f9cb-4b67-b027-a704c91b3150/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2024-12-02 13:08:06,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:08:06,205 INFO L204 MainTranslator]: Completed translation [2024-12-02 13:08:06,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06 WrapperNode [2024-12-02 13:08:06,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 13:08:06,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 13:08:06,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 13:08:06,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 13:08:06,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,228 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2024-12-02 13:08:06,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 13:08:06,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 13:08:06,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 13:08:06,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 13:08:06,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,247 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-12-02 13:08:06,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 13:08:06,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 13:08:06,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 13:08:06,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 13:08:06,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (1/1) ... [2024-12-02 13:08:06,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:08:06,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:08:06,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 13:08:06,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 13:08:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 13:08:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 13:08:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 13:08:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 13:08:06,383 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 13:08:06,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 13:08:06,623 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-12-02 13:08:06,623 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 13:08:06,631 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 13:08:06,631 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 13:08:06,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:06 BoogieIcfgContainer [2024-12-02 13:08:06,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 13:08:06,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 13:08:06,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 13:08:06,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 13:08:06,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:08:06" (1/3) ... [2024-12-02 13:08:06,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705e3275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:08:06, skipping insertion in model container [2024-12-02 13:08:06,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:06" (2/3) ... [2024-12-02 13:08:06,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705e3275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:08:06, skipping insertion in model container [2024-12-02 13:08:06,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:06" (3/3) ... [2024-12-02 13:08:06,639 INFO L128 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2024-12-02 13:08:06,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 13:08:06,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG drift_tenth.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 13:08:06,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 13:08:06,696 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;@431d1138, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 13:08:06,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 13:08:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:08:06,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 13:08:06,702 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:08:06,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 13:08:06,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:08:06,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:08:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times [2024-12-02 13:08:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 13:08:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829874398] [2024-12-02 13:08:06,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:08:06,715 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-12-02 13:08:06,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 13:08:06,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:06,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:08:06,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 13:08:06,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:08:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:08:06,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:08:06,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 13:08:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829874398] [2024-12-02 13:08:06,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829874398] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:08:06,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:08:06,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:08:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807517318] [2024-12-02 13:08:06,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:08:06,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:08:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 13:08:06,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:08:06,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:08:06,839 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-02 13:08:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:08:06,891 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-12-02 13:08:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:08:06,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-12-02 13:08:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:08:06,896 INFO L225 Difference]: With dead ends: 22 [2024-12-02 13:08:06,897 INFO L226 Difference]: Without dead ends: 10 [2024-12-02 13:08:06,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12-02 13:08:06,901 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:08:06,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:08:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-12-02 13:08:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-12-02 13:08:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:08:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-12-02 13:08:06,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-12-02 13:08:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:08:06,927 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-12-02 13:08:06,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-02 13:08:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-12-02 13:08:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-02 13:08:06,928 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:08:06,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:08:06,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-12-02 13:08:07,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:07,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:08:07,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:08:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash 207982255, now seen corresponding path program 1 times [2024-12-02 13:08:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 13:08:07,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190996124] [2024-12-02 13:08:07,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:08:07,130 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-12-02 13:08:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 13:08:07,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:07,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:08:07,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 13:08:07,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:08:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:08:07,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:08:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:08:07,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 13:08:07,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190996124] [2024-12-02 13:08:07,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190996124] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:08:07,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 13:08:07,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-12-02 13:08:07,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530636909] [2024-12-02 13:08:07,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 13:08:07,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:08:07,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 13:08:07,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:08:07,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:08:07,247 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:08:07,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:08:07,475 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-12-02 13:08:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:08:07,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-12-02 13:08:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:08:07,476 INFO L225 Difference]: With dead ends: 19 [2024-12-02 13:08:07,476 INFO L226 Difference]: Without dead ends: 15 [2024-12-02 13:08:07,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:08:07,477 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:08:07,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:08:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-12-02 13:08:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-12-02 13:08:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-12-02 13:08:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-12-02 13:08:07,480 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-12-02 13:08:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:08:07,480 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-12-02 13:08:07,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:08:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-12-02 13:08:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 13:08:07,481 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:08:07,481 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-12-02 13:08:07,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:07,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:07,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:08:07,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:08:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash -858744965, now seen corresponding path program 2 times [2024-12-02 13:08:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 13:08:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903250815] [2024-12-02 13:08:07,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 13:08:07,683 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-12-02 13:08:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 13:08:07,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:07,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:07,792 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 13:08:07,793 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:08:07,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 13:08:07,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:08:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:08:07,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:08:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:08:07,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 13:08:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903250815] [2024-12-02 13:08:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903250815] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:08:07,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 13:08:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-12-02 13:08:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970020803] [2024-12-02 13:08:07,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 13:08:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 13:08:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 13:08:07,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 13:08:07,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-12-02 13:08:07,989 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:08:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:08:08,750 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-12-02 13:08:08,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 13:08:08,750 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-12-02 13:08:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:08:08,751 INFO L225 Difference]: With dead ends: 31 [2024-12-02 13:08:08,751 INFO L226 Difference]: Without dead ends: 27 [2024-12-02 13:08:08,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-12-02 13:08:08,752 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 13:08:08,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 13:08:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-12-02 13:08:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-12-02 13:08:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-12-02 13:08:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-12-02 13:08:08,759 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-12-02 13:08:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:08:08,759 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-12-02 13:08:08,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:08:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-12-02 13:08:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 13:08:08,760 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:08:08,760 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-12-02 13:08:08,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:08,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:08,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:08:08,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:08:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1255476755, now seen corresponding path program 3 times [2024-12-02 13:08:08,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 13:08:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338939323] [2024-12-02 13:08:08,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 13:08:08,961 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-12-02 13:08:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 13:08:08,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:08,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:08:09,261 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-12-02 13:08:09,261 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:08:09,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 13:08:09,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:10:46,903 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-02 13:10:53,020 WARN L286 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:11:02,368 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:11:08,515 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:11:12,538 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 13:11:20,339 WARN L286 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:11:27,290 WARN L286 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:11:33,391 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:12:53,689 WARN L286 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-02 13:13:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 74 refuted. 7 times theorem prover too weak. 0 trivial. 19 not checked. [2024-12-02 13:13:05,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:15:48,085 WARN L286 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:15:52,101 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2024-12-02 13:15:56,115 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2024-12-02 13:16:07,182 WARN L286 SmtUtils]: Spent 7.70s 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-12-02 13:16:11,200 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2024-12-02 13:16:21,171 WARN L286 SmtUtils]: Spent 7.37s 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-12-02 13:16:29,211 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:16:33,232 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2024-12-02 13:16:37,253 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2024-12-02 13:16:45,300 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:16:53,355 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:16:57,382 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2024-12-02 13:17:01,404 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2024-12-02 13:17:09,459 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:17:17,511 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:17:21,536 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2024-12-02 13:17:25,562 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2024-12-02 13:17:33,615 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:17:41,676 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:17:45,707 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2024-12-02 13:17:49,738 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2024-12-02 13:17:57,796 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:18:05,864 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:18:09,898 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2024-12-02 13:18:13,933 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2024-12-02 13:18:22,000 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:18:30,056 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 13:18:34,086 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2024-12-02 13:18:38,113 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2024-12-02 13:18:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 91 not checked. [2024-12-02 13:18:38,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 13:18:38,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338939323] [2024-12-02 13:18:38,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338939323] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:18:38,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 13:18:38,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-12-02 13:18:38,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833530323] [2024-12-02 13:18:38,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 13:18:38,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-12-02 13:18:38,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 13:18:38,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-12-02 13:18:38,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=242, Unknown=43, NotChecked=378, Total=756 [2024-12-02 13:18:38,115 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 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-12-02 13:18:40,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 13:18:44,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 13:18:48,978 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 13:18:56,576 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 13:19:04,287 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 13:19:08,321 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 13:19:12,348 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 13:19:16,379 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2024-12-02 13:19:20,404 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2024-12-02 13:19:24,436 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 13:19:28,464 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 13:19:32,494 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 13:19:38,280 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|)) is different from false [2024-12-02 13:19:44,605 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 13:19:50,897 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 13:19:54,919 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 13:20:02,721 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 13:20:05,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:20:09,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:20:11,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:20:14,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:20:16,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:20:20,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:20:23,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:20:25,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:20:29,727 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 [] [2024-12-02 13:20:31,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:20:35,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:21:04,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:21:08,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:21:18,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:21:22,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:21:24,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:21:52,539 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 [] [2024-12-02 13:21:55,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:22:00,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:22:02,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:22:06,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:22:09,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:22:11,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:22:14,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 13:22:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:22:14,566 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-12-02 13:22:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 13:22:14,580 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 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 26 [2024-12-02 13:22:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:22:14,581 INFO L225 Difference]: With dead ends: 40 [2024-12-02 13:22:14,581 INFO L226 Difference]: Without dead ends: 35 [2024-12-02 13:22:14,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 558.8s TimeCoverageRelationStatistics Valid=145, Invalid=338, Unknown=59, NotChecked=1180, Total=1722 [2024-12-02 13:22:14,582 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 692 IncrementalHoareTripleChecker+Unchecked, 84.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:22:14,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 50 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 9 Unknown, 692 Unchecked, 84.0s Time] [2024-12-02 13:22:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-12-02 13:22:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-12-02 13:22:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-12-02 13:22:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-12-02 13:22:14,586 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 26 [2024-12-02 13:22:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:22:14,586 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-12-02 13:22:14,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 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-12-02 13:22:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-12-02 13:22:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 13:22:14,587 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:22:14,588 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2024-12-02 13:22:14,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-12-02 13:22:14,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:22:14,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:22:14,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:22:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash -433873321, now seen corresponding path program 4 times [2024-12-02 13:22:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 13:22:14,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979021215] [2024-12-02 13:22:14,789 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 13:22:14,789 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-12-02 13:22:14,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 13:22:14,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:22:14,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:22:15,025 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 13:22:15,025 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:22:15,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 13:22:15,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:22:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:22:15,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:22:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:22:17,386 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 13:22:17,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979021215] [2024-12-02 13:22:17,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979021215] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:22:17,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 13:22:17,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-12-02 13:22:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762567466] [2024-12-02 13:22:17,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 13:22:17,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 13:22:17,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 13:22:17,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 13:22:17,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-12-02 13:22:17,389 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 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-12-02 13:22:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:22:19,723 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-12-02 13:22:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 13:22:19,727 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 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 28 [2024-12-02 13:22:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:22:19,727 INFO L225 Difference]: With dead ends: 33 [2024-12-02 13:22:19,727 INFO L226 Difference]: Without dead ends: 0 [2024-12-02 13:22:19,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-12-02 13:22:19,729 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:22:19,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 13:22:19,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-12-02 13:22:19,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-12-02 13:22:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-12-02 13:22:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-12-02 13:22:19,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2024-12-02 13:22:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:22:19,730 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-12-02 13:22:19,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 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-12-02 13:22:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-12-02 13:22:19,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-02 13:22:19,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 13:22:19,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:22:19,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c0cbbc-f9cb-4b67-b027-a704c91b3150/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:22:19,935 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2024-12-02 13:22:19,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.