./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya --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 cdf93f59dd274ab086c68aef6e20ded5f344701c9de4a190c50002498c40f88d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:40:38,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:40:38,252 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:40:38,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:40:38,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:40:38,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:40:38,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:40:38,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:40:38,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:40:38,284 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:40:38,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:40:38,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:40:38,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:40:38,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:40:38,287 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:40:38,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:40:38,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:40:38,288 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:40:38,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:40:38,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:40:38,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:40:38,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:40:38,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:40:38,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:40:38,291 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:40:38,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:40:38,292 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:40:38,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:40:38,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:40:38,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:40:38,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:40:38,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:40:38,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:40:38,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:40:38,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:40:38,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:40:38,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:40:38,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:40:38,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:40:38,297 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:40:38,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:40:38,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:40:38,298 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya 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 -> cdf93f59dd274ab086c68aef6e20ded5f344701c9de4a190c50002498c40f88d [2023-11-29 00:40:38,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:40:38,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:40:38,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:40:38,542 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:40:38,542 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:40:38,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i [2023-11-29 00:40:41,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:40:41,505 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:40:41,506 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i [2023-11-29 00:40:41,518 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/data/88d6c7e99/99364e80b8114b128a21622462168eb1/FLAGae7c91293 [2023-11-29 00:40:41,532 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/data/88d6c7e99/99364e80b8114b128a21622462168eb1 [2023-11-29 00:40:41,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:40:41,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:40:41,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:40:41,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:40:41,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:40:41,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5523ff48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41, skipping insertion in model container [2023-11-29 00:40:41,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,573 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:40:41,700 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i[916,929] [2023-11-29 00:40:41,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:40:41,759 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:40:41,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i[916,929] [2023-11-29 00:40:41,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:40:41,806 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:40:41,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41 WrapperNode [2023-11-29 00:40:41,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:40:41,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:40:41,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:40:41,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:40:41,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,859 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2023-11-29 00:40:41,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:40:41,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:40:41,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:40:41,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:40:41,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,890 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]. [2023-11-29 00:40:41,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:40:41,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:40:41,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:40:41,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:40:41,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (1/1) ... [2023-11-29 00:40:41,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:40:41,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:40:41,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:40:41,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:40:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:40:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:40:41,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:40:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:40:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:40:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:40:42,055 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:40:42,057 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:40:42,342 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:40:42,381 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:40:42,382 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:40:42,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:40:42 BoogieIcfgContainer [2023-11-29 00:40:42,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:40:42,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:40:42,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:40:42,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:40:42,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:40:41" (1/3) ... [2023-11-29 00:40:42,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2973e31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:40:42, skipping insertion in model container [2023-11-29 00:40:42,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:41" (2/3) ... [2023-11-29 00:40:42,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2973e31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:40:42, skipping insertion in model container [2023-11-29 00:40:42,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:40:42" (3/3) ... [2023-11-29 00:40:42,391 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-0.i [2023-11-29 00:40:42,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:40:42,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:40:42,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:40:42,452 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@56c4a28c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:40:42,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:40:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:40:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 00:40:42,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:40:42,468 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:40:42,468 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:40:42,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:40:42,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1555128480, now seen corresponding path program 1 times [2023-11-29 00:40:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:40:42,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505883607] [2023-11-29 00:40:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:40:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:40:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:40:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:40:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:40:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:40:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:40:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:40:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:40:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:40:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:40:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:40:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:40:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 00:40:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:40:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:40:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:40:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:40:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:40:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 00:40:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 00:40:42,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:40:42,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505883607] [2023-11-29 00:40:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505883607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:40:42,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:40:42,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:40:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486344603] [2023-11-29 00:40:42,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:40:42,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:40:42,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:40:42,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:40:42,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:40:42,816 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 00:40:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:40:42,852 INFO L93 Difference]: Finished difference Result 109 states and 186 transitions. [2023-11-29 00:40:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:40:42,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-11-29 00:40:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:40:42,861 INFO L225 Difference]: With dead ends: 109 [2023-11-29 00:40:42,862 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 00:40:42,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:40:42,869 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:40:42,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:40:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 00:40:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 00:40:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:40:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2023-11-29 00:40:42,908 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 118 [2023-11-29 00:40:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:40:42,908 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2023-11-29 00:40:42,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 00:40:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2023-11-29 00:40:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 00:40:42,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:40:42,912 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:40:42,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:40:42,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:40:42,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:40:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1527854172, now seen corresponding path program 1 times [2023-11-29 00:40:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:40:42,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881229645] [2023-11-29 00:40:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:40:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:40:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:40:43,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:40:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:40:43,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:40:43,243 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:40:43,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:40:43,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:40:43,248 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 00:40:43,251 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:40:43,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:40:43 BoogieIcfgContainer [2023-11-29 00:40:43,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:40:43,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:40:43,320 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:40:43,321 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:40:43,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:40:42" (3/4) ... [2023-11-29 00:40:43,323 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:40:43,323 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:40:43,324 INFO L158 Benchmark]: Toolchain (without parser) took 1788.21ms. Allocated memory is still 169.9MB. Free memory was 124.6MB in the beginning and 125.4MB in the end (delta: -875.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:40:43,325 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:40:43,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.54ms. Allocated memory is still 169.9MB. Free memory was 124.6MB in the beginning and 110.7MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:40:43,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.48ms. Allocated memory is still 169.9MB. Free memory was 110.7MB in the beginning and 107.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:40:43,326 INFO L158 Benchmark]: Boogie Preprocessor took 51.99ms. Allocated memory is still 169.9MB. Free memory was 107.8MB in the beginning and 104.0MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:40:43,327 INFO L158 Benchmark]: RCFGBuilder took 470.19ms. Allocated memory is still 169.9MB. Free memory was 103.6MB in the beginning and 135.8MB in the end (delta: -32.2MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2023-11-29 00:40:43,327 INFO L158 Benchmark]: TraceAbstraction took 934.90ms. Allocated memory is still 169.9MB. Free memory was 135.1MB in the beginning and 125.4MB in the end (delta: 9.7MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2023-11-29 00:40:43,328 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 169.9MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:40:43,331 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.18ms. Allocated memory is still 109.1MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.54ms. Allocated memory is still 169.9MB. Free memory was 124.6MB in the beginning and 110.7MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.48ms. Allocated memory is still 169.9MB. Free memory was 110.7MB in the beginning and 107.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.99ms. Allocated memory is still 169.9MB. Free memory was 107.8MB in the beginning and 104.0MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.19ms. Allocated memory is still 169.9MB. Free memory was 103.6MB in the beginning and 135.8MB in the end (delta: -32.2MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 934.90ms. Allocated memory is still 169.9MB. Free memory was 135.1MB in the beginning and 125.4MB in the end (delta: 9.7MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 169.9MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 32; [L25] signed long int var_1_4 = -32; [L26] signed long int var_1_5 = 2; [L27] signed short int var_1_6 = -10; [L28] unsigned long int var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned long int var_1_9 = 3470417420; [L31] unsigned char var_1_10 = 0; [L32] double var_1_11 = 32.875; [L33] double var_1_12 = 25.6; [L34] double var_1_13 = 1.75; [L35] float var_1_14 = 5.4; [L36] float var_1_15 = 127.5; [L37] float var_1_16 = 3.5; [L38] signed long int var_1_17 = 64; [L39] unsigned char var_1_18 = 64; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] FCALL updateLastVariables() [L127] CALL updateVariables() [L86] var_1_2 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L87] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L88] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L88] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L89] var_1_3 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L91] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L91] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L92] var_1_4 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L93] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L94] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L94] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L95] var_1_9 = __VERIFIER_nondet_ulong() [L96] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L96] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L97] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L97] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L99] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L101] var_1_11 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L102] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L103] var_1_12 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L104] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L105] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L105] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L106] var_1_13 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L107] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L109] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L110] var_1_16 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L111] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L112] var_1_18 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L113] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L114] CALL assume_abort_if_not(var_1_18 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L114] RET assume_abort_if_not(var_1_18 <= 255) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L127] RET updateVariables() [L128] CALL step() [L43] COND TRUE var_1_2 > (- var_1_3) [L44] var_1_1 = ((((var_1_3) > ((var_1_2 + var_1_4))) ? (var_1_3) : ((var_1_2 + var_1_4)))) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L48] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=43, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L49] COND TRUE var_1_3 < stepLocal_0 [L50] var_1_5 = ((var_1_2 - var_1_3) + var_1_4) VAL [isInitial=1, stepLocal_0=43, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L52] unsigned char stepLocal_1 = var_1_2; VAL [isInitial=1, stepLocal_0=43, stepLocal_1=43, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L53] COND FALSE !(stepLocal_1 < (- var_1_5)) VAL [isInitial=1, stepLocal_0=43, stepLocal_1=43, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L56] signed short int stepLocal_3 = var_1_6; [L57] signed long int stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_0=43, stepLocal_1=43, stepLocal_2=33, stepLocal_3=-10, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L58] COND FALSE !(stepLocal_2 > var_1_3) VAL [isInitial=1, stepLocal_0=43, stepLocal_1=43, stepLocal_2=33, stepLocal_3=-10, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L63] unsigned long int stepLocal_4 = var_1_9 - var_1_2; VAL [isInitial=1, stepLocal_0=43, stepLocal_1=43, stepLocal_2=33, stepLocal_3=-10, stepLocal_4=4294967252, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L64] COND TRUE (- 8u) >= stepLocal_4 [L65] var_1_8 = (! var_1_10) VAL [isInitial=1, stepLocal_0=43, stepLocal_1=43, stepLocal_2=33, stepLocal_3=-10, stepLocal_4=4294967252, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L69] unsigned long int stepLocal_5 = var_1_9; VAL [isInitial=1, stepLocal_0=43, stepLocal_1=43, stepLocal_2=33, stepLocal_3=-10, stepLocal_4=4294967252, stepLocal_5=4294967295, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L70] COND FALSE !((var_1_12 * var_1_11) > var_1_13) [L77] var_1_14 = var_1_16 VAL [isInitial=1, stepLocal_0=43, stepLocal_1=43, stepLocal_2=33, stepLocal_3=-10, stepLocal_4=4294967252, stepLocal_5=4294967295, var_1_10=1, var_1_14=4294967300, var_1_16=4294967300, var_1_17=64, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L79] COND TRUE ((var_1_11 + var_1_14) / 9.2) < ((((var_1_13) < (var_1_16)) ? (var_1_13) : (var_1_16))) [L80] var_1_17 = ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))) VAL [isInitial=1, stepLocal_0=43, stepLocal_1=43, stepLocal_2=33, stepLocal_3=-10, stepLocal_4=4294967252, stepLocal_5=4294967295, var_1_10=1, var_1_14=4294967300, var_1_16=4294967300, var_1_17=43, var_1_18=4, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L128] RET step() [L129] CALL, EXPR property() [L119-L120] return (((((((var_1_2 > (- var_1_3)) ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_2 + var_1_4))) ? (var_1_3) : ((var_1_2 + var_1_4)))))) : (var_1_1 == ((signed long int) (((((1 - var_1_2)) < (16)) ? ((1 - var_1_2)) : (16)))))) && ((var_1_3 < var_1_2) ? (var_1_5 == ((signed long int) ((var_1_2 - var_1_3) + var_1_4))) : 1)) && ((var_1_2 < (- var_1_5)) ? (var_1_6 == ((signed short int) (32 - var_1_3))) : 1)) && ((var_1_1 > var_1_3) ? ((var_1_4 <= var_1_6) ? (var_1_7 == ((unsigned long int) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_2)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_11 / var_1_12) >= var_1_13) || var_1_10))))) && (((var_1_12 * var_1_11) > var_1_13) ? ((var_1_9 < var_1_5) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((var_1_11 + var_1_14) / 9.2) < ((((var_1_13) < (var_1_16)) ? (var_1_13) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))))) : (var_1_17 == ((signed long int) var_1_4))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_14=4294967300, var_1_16=4294967300, var_1_17=43, var_1_18=4, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_14=4294967300, var_1_16=4294967300, var_1_17=43, var_1_18=4, var_1_1=33, var_1_2=43, var_1_3=33, var_1_4=-10, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967295] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 77 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 612/612 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 00:40:43,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya --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 cdf93f59dd274ab086c68aef6e20ded5f344701c9de4a190c50002498c40f88d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:40:45,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:40:45,317 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 00:40:45,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:40:45,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:40:45,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:40:45,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:40:45,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:40:45,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:40:45,356 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:40:45,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:40:45,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:40:45,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:40:45,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:40:45,359 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:40:45,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:40:45,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:40:45,360 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:40:45,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:40:45,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:40:45,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:40:45,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:40:45,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:40:45,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:40:45,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:40:45,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:40:45,364 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:40:45,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:40:45,365 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:40:45,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:40:45,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:40:45,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:40:45,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:40:45,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:40:45,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:40:45,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:40:45,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:40:45,368 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:40:45,368 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:40:45,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:40:45,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:40:45,369 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:40:45,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:40:45,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:40:45,369 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:40:45,370 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya 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 -> cdf93f59dd274ab086c68aef6e20ded5f344701c9de4a190c50002498c40f88d [2023-11-29 00:40:45,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:40:45,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:40:45,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:40:45,670 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:40:45,670 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:40:45,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i [2023-11-29 00:40:48,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:40:48,676 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:40:48,677 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i [2023-11-29 00:40:48,686 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/data/5b67f4f2d/b7f50030715547c5b04a3973e5559d3b/FLAG730afac45 [2023-11-29 00:40:48,701 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/data/5b67f4f2d/b7f50030715547c5b04a3973e5559d3b [2023-11-29 00:40:48,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:40:48,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:40:48,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:40:48,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:40:48,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:40:48,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:40:48" (1/1) ... [2023-11-29 00:40:48,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fccc17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:48, skipping insertion in model container [2023-11-29 00:40:48,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:40:48" (1/1) ... [2023-11-29 00:40:48,747 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:40:48,898 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i[916,929] [2023-11-29 00:40:48,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:40:48,967 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:40:48,980 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-0.i[916,929] [2023-11-29 00:40:49,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:40:49,027 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:40:49,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49 WrapperNode [2023-11-29 00:40:49,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:40:49,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:40:49,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:40:49,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:40:49,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,077 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2023-11-29 00:40:49,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:40:49,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:40:49,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:40:49,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:40:49,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,108 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]. [2023-11-29 00:40:49,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:40:49,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:40:49,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:40:49,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:40:49,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (1/1) ... [2023-11-29 00:40:49,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:40:49,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:40:49,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:40:49,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:40:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:40:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:40:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:40:49,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:40:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:40:49,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:40:49,284 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:40:49,286 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:41:07,954 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:41:07,995 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:41:07,995 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:41:07,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:41:07 BoogieIcfgContainer [2023-11-29 00:41:07,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:41:07,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:41:07,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:41:08,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:41:08,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:40:48" (1/3) ... [2023-11-29 00:41:08,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252e91b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:41:08, skipping insertion in model container [2023-11-29 00:41:08,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:40:49" (2/3) ... [2023-11-29 00:41:08,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252e91b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:41:08, skipping insertion in model container [2023-11-29 00:41:08,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:41:07" (3/3) ... [2023-11-29 00:41:08,005 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-0.i [2023-11-29 00:41:08,023 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:41:08,023 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:41:08,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:41:08,077 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@279082e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:41:08,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:41:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:41:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 00:41:08,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:08,097 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:41:08,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:08,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:08,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1555128480, now seen corresponding path program 1 times [2023-11-29 00:41:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:41:08,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744849670] [2023-11-29 00:41:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:08,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:41:08,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:41:08,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:41:08,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:41:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:09,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 00:41:09,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-11-29 00:41:09,905 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:41:09,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:41:09,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744849670] [2023-11-29 00:41:09,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744849670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:09,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:41:09,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767934970] [2023-11-29 00:41:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:09,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:41:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:41:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:41:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:41:09,952 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 00:41:15,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.88s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:41:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:15,881 INFO L93 Difference]: Finished difference Result 109 states and 186 transitions. [2023-11-29 00:41:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:41:16,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-11-29 00:41:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:16,368 INFO L225 Difference]: With dead ends: 109 [2023-11-29 00:41:16,368 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 00:41:16,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:41:16,373 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:16,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2023-11-29 00:41:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 00:41:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 00:41:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:41:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2023-11-29 00:41:16,405 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 118 [2023-11-29 00:41:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:16,405 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2023-11-29 00:41:16,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 00:41:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2023-11-29 00:41:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 00:41:16,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:16,408 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:41:16,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:41:16,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:41:16,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:16,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1527854172, now seen corresponding path program 1 times [2023-11-29 00:41:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:41:16,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216374909] [2023-11-29 00:41:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:16,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:41:16,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:41:16,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:41:16,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cee82ea2-1650-4b0d-ad5d-b0fd0b709871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:41:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:18,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 00:41:18,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:44,594 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:41:56,791 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:42:22,791 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:42:37,224 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:44:51,147 WARN L293 SmtUtils]: Spent 48.75s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:44:59,941 WARN L293 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:45:08,713 WARN L293 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:45:17,512 WARN L293 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:45:26,283 WARN L293 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:45:34,710 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:45:43,487 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:45:52,465 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:46:01,250 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:46:10,039 WARN L293 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:46:18,848 WARN L293 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:46:27,768 WARN L293 SmtUtils]: Spent 8.92s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:46:36,550 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:46:45,345 WARN L293 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:46:54,133 WARN L293 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:47:02,943 WARN L293 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:47:11,790 WARN L293 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:47:20,636 WARN L293 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:47:29,372 WARN L293 SmtUtils]: Spent 8.74s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:47:38,292 WARN L293 SmtUtils]: Spent 8.92s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:47:47,810 WARN L293 SmtUtils]: Spent 9.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:47:56,608 WARN L293 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:48:05,439 WARN L293 SmtUtils]: Spent 8.83s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:48:14,318 WARN L293 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:48:23,204 WARN L293 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:48:32,071 WARN L293 SmtUtils]: Spent 8.87s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:48:40,936 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:48:49,800 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:48:58,661 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:49:07,521 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:49:11,713 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_3~0)) (.cse1 ((_ zero_extend 24) c_~var_1_2~0))) (and (let ((.cse0 (= c_~var_1_10~0 (_ bv0 8)))) (or (and (not .cse0) (= c_~var_1_8~0 (_ bv0 8))) (and (= (_ bv1 8) c_~var_1_8~0) .cse0))) (not (bvslt .cse1 (bvneg c_~var_1_5~0))) (= c_~var_1_14~0 c_~var_1_16~0) (not (bvsgt c_~var_1_1~0 .cse2)) (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 (bvneg .cse1))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 c_~var_1_11~0) c_~var_1_13~0)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_16~0 .cse3) (fp.leq c_~var_1_16~0 .cse4)) (and (fp.leq c_~var_1_16~0 (fp.neg .cse3)) (fp.geq c_~var_1_16~0 (fp.neg .cse4))))) (bvsle c_~var_1_4~0 (_ bv1073741823 32)) (let ((.cse6 (bvadd c_~var_1_4~0 .cse1))) (let ((.cse5 (bvsgt .cse2 .cse6))) (or (and .cse5 (= c_~var_1_1~0 .cse2)) (and (not .cse5) (= c_~var_1_1~0 .cse6))))) (= c_~var_1_5~0 (bvadd (bvneg .cse2) c_~var_1_4~0 .cse1)) (let ((.cse8 ((_ zero_extend 24) c_~var_1_18~0))) (let ((.cse7 (bvsgt .cse1 .cse8))) (or (and (= c_~var_1_17~0 .cse1) .cse7) (and (not .cse7) (= c_~var_1_17~0 .cse8))))) (bvslt .cse2 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (let ((.cse11 (fp.lt c_~var_1_13~0 .cse10)) (.cse9 (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_11~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))))) (or (and (fp.lt .cse9 .cse10) (not .cse11)) (and .cse11 (fp.lt .cse9 c_~var_1_13~0))))))) is different from false [2023-11-29 00:49:16,039 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_3~0)) (.cse1 ((_ zero_extend 24) c_~var_1_2~0))) (and (let ((.cse0 (= c_~var_1_10~0 (_ bv0 8)))) (or (and (not .cse0) (= c_~var_1_8~0 (_ bv0 8))) (and (= (_ bv1 8) c_~var_1_8~0) .cse0))) (not (bvslt .cse1 (bvneg c_~var_1_5~0))) (= c_~var_1_14~0 c_~var_1_16~0) (not (bvsgt c_~var_1_1~0 .cse2)) (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 (bvneg .cse1))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 c_~var_1_11~0) c_~var_1_13~0)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_16~0 .cse3) (fp.leq c_~var_1_16~0 .cse4)) (and (fp.leq c_~var_1_16~0 (fp.neg .cse3)) (fp.geq c_~var_1_16~0 (fp.neg .cse4))))) (bvsle c_~var_1_4~0 (_ bv1073741823 32)) (let ((.cse6 (bvadd c_~var_1_4~0 .cse1))) (let ((.cse5 (bvsgt .cse2 .cse6))) (or (and .cse5 (= c_~var_1_1~0 .cse2)) (and (not .cse5) (= c_~var_1_1~0 .cse6))))) (= c_~var_1_5~0 (bvadd (bvneg .cse2) c_~var_1_4~0 .cse1)) (let ((.cse8 ((_ zero_extend 24) c_~var_1_18~0))) (let ((.cse7 (bvsgt .cse1 .cse8))) (or (and (= c_~var_1_17~0 .cse1) .cse7) (and (not .cse7) (= c_~var_1_17~0 .cse8))))) (bvslt .cse2 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (let ((.cse11 (fp.lt c_~var_1_13~0 .cse10)) (.cse9 (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_11~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))))) (or (and (fp.lt .cse9 .cse10) (not .cse11)) (and .cse11 (fp.lt .cse9 c_~var_1_13~0))))))) is different from true