./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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_8cd115af-3a36-41e8-8a71-429ae90878bd/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 a1c694b535a0db632a25942de489387c8249c42f83b73f06ffeb76130c0a4677 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:02:16,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:02:16,411 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:02:16,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:02:16,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:02:16,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:02:16,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:02:16,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:02:16,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:02:16,443 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:02:16,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:02:16,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:02:16,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:02:16,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:02:16,446 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:02:16,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:02:16,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:02:16,448 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:02:16,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:02:16,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:02:16,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:02:16,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:02:16,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:02:16,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:02:16,451 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:02:16,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:02:16,452 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:02:16,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:02:16,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:02:16,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:02:16,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:02:16,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:02:16,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:02:16,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:02:16,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:02:16,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:02:16,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:02:16,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:02:16,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:02:16,456 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:02:16,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:02:16,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:02:16,457 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_8cd115af-3a36-41e8-8a71-429ae90878bd/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_8cd115af-3a36-41e8-8a71-429ae90878bd/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 -> a1c694b535a0db632a25942de489387c8249c42f83b73f06ffeb76130c0a4677 [2023-11-29 05:02:16,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:02:16,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:02:16,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:02:16,700 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:02:16,700 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:02:16,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i [2023-11-29 05:02:19,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:02:19,660 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:02:19,661 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i [2023-11-29 05:02:19,671 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/data/b2bf9c7b4/3ba6baea16c842728cbc36dc46cb066a/FLAG19f5783aa [2023-11-29 05:02:19,685 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/data/b2bf9c7b4/3ba6baea16c842728cbc36dc46cb066a [2023-11-29 05:02:19,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:02:19,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:02:19,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:02:19,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:02:19,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:02:19,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:19,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425d9a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19, skipping insertion in model container [2023-11-29 05:02:19,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:19,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:02:19,870 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_8cd115af-3a36-41e8-8a71-429ae90878bd/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i[913,926] [2023-11-29 05:02:19,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:02:19,933 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:02:19,945 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_8cd115af-3a36-41e8-8a71-429ae90878bd/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i[913,926] [2023-11-29 05:02:19,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:02:19,991 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:02:19,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19 WrapperNode [2023-11-29 05:02:19,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:02:19,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:02:19,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:02:19,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:02:19,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,038 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2023-11-29 05:02:20,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:02:20,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:02:20,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:02:20,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:02:20,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,071 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 05:02:20,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:02:20,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:02:20,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:02:20,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:02:20,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (1/1) ... [2023-11-29 05:02:20,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:02:20,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:02:20,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:02:20,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:02:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:02:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:02:20,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:02:20,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:02:20,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:02:20,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:02:20,255 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:02:20,257 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:02:20,577 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:02:20,617 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:02:20,617 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:02:20,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:02:20 BoogieIcfgContainer [2023-11-29 05:02:20,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:02:20,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:02:20,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:02:20,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:02:20,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:02:19" (1/3) ... [2023-11-29 05:02:20,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1778e2f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:02:20, skipping insertion in model container [2023-11-29 05:02:20,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:19" (2/3) ... [2023-11-29 05:02:20,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1778e2f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:02:20, skipping insertion in model container [2023-11-29 05:02:20,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:02:20" (3/3) ... [2023-11-29 05:02:20,626 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-43.i [2023-11-29 05:02:20,644 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:02:20,644 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:02:20,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:02:20,688 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;@1d8825ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:02:20,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:02:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 05:02:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-29 05:02:20,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:02:20,707 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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 05:02:20,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:02:20,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:02:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1822455397, now seen corresponding path program 1 times [2023-11-29 05:02:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:02:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078399604] [2023-11-29 05:02:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:02:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:02:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:02:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:02:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:02:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:02:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:02:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:02:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:02:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:02:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:02:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:02:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:02:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:02:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:02:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 05:02:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:02:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:02:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:02:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:02:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 05:02:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:02:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 05:02:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:02:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 05:02:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:02:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 05:02:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:02:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 05:02:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 05:02:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 05:02:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 05:02:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 05:02:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 05:02:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 05:02:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-29 05:02:21,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:02:21,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078399604] [2023-11-29 05:02:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078399604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:02:21,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:02:21,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:02:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560659851] [2023-11-29 05:02:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:02:21,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:02:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:02:21,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:02:21,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:02:21,205 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-29 05:02:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:02:21,249 INFO L93 Difference]: Finished difference Result 159 states and 291 transitions. [2023-11-29 05:02:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:02:21,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 199 [2023-11-29 05:02:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:02:21,260 INFO L225 Difference]: With dead ends: 159 [2023-11-29 05:02:21,260 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 05:02:21,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 05:02:21,268 INFO L413 NwaCegarLoop]: 122 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, 122 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 05:02:21,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:02:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 05:02:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-29 05:02:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 05:02:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 125 transitions. [2023-11-29 05:02:21,314 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 125 transitions. Word has length 199 [2023-11-29 05:02:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:02:21,315 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 125 transitions. [2023-11-29 05:02:21,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-29 05:02:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 125 transitions. [2023-11-29 05:02:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-29 05:02:21,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:02:21,321 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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 05:02:21,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:02:21,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:02:21,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:02:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash -66979293, now seen corresponding path program 1 times [2023-11-29 05:02:21,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:02:21,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531343333] [2023-11-29 05:02:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:02:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:02:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:02:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:02:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:02:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:02:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:02:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:02:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:02:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:02:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:02:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:02:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:02:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:02:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:02:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 05:02:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:02:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:02:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:02:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:02:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 05:02:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:02:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 05:02:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:02:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 05:02:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:02:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 05:02:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:02:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 05:02:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 05:02:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 05:02:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 05:02:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 05:02:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 05:02:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 05:02:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-29 05:02:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:02:21,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531343333] [2023-11-29 05:02:21,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531343333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:02:21,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:02:21,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:02:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550451758] [2023-11-29 05:02:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:02:21,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:02:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:02:21,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:02:21,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:02:21,698 INFO L87 Difference]: Start difference. First operand 79 states and 125 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-29 05:02:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:02:21,735 INFO L93 Difference]: Finished difference Result 158 states and 251 transitions. [2023-11-29 05:02:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:02:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 199 [2023-11-29 05:02:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:02:21,739 INFO L225 Difference]: With dead ends: 158 [2023-11-29 05:02:21,739 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 05:02:21,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:02:21,743 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:02:21,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:02:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 05:02:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-29 05:02:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 05:02:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2023-11-29 05:02:21,759 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 199 [2023-11-29 05:02:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:02:21,761 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2023-11-29 05:02:21,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-29 05:02:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2023-11-29 05:02:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-29 05:02:21,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:02:21,766 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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 05:02:21,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:02:21,766 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:02:21,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:02:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash 634085285, now seen corresponding path program 1 times [2023-11-29 05:02:21,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:02:21,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267389381] [2023-11-29 05:02:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:02:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:02:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:02:21,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:02:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:02:22,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:02:22,126 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:02:22,128 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:02:22,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:02:22,134 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 05:02:22,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:02:22,224 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 05:02:22,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short25 could not be translated [2023-11-29 05:02:22,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:02:22 BoogieIcfgContainer [2023-11-29 05:02:22,252 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:02:22,252 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:02:22,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:02:22,253 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:02:22,253 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:02:20" (3/4) ... [2023-11-29 05:02:22,255 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:02:22,256 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:02:22,257 INFO L158 Benchmark]: Toolchain (without parser) took 2568.21ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 99.4MB in the beginning and 119.4MB in the end (delta: -19.9MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2023-11-29 05:02:22,258 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory was 67.2MB in the beginning and 67.2MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:02:22,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.96ms. Allocated memory is still 136.3MB. Free memory was 99.0MB in the beginning and 85.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:02:22,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 136.3MB. Free memory was 84.8MB in the beginning and 81.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:02:22,259 INFO L158 Benchmark]: Boogie Preprocessor took 54.80ms. Allocated memory is still 136.3MB. Free memory was 81.8MB in the beginning and 78.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:02:22,260 INFO L158 Benchmark]: RCFGBuilder took 522.91ms. Allocated memory is still 136.3MB. Free memory was 78.4MB in the beginning and 91.1MB in the end (delta: -12.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-11-29 05:02:22,260 INFO L158 Benchmark]: TraceAbstraction took 1631.71ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 90.3MB in the beginning and 119.4MB in the end (delta: -29.1MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2023-11-29 05:02:22,261 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 163.6MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:02:22,263 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.16ms. Allocated memory is still 98.6MB. Free memory was 67.2MB in the beginning and 67.2MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.96ms. Allocated memory is still 136.3MB. Free memory was 99.0MB in the beginning and 85.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 136.3MB. Free memory was 84.8MB in the beginning and 81.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.80ms. Allocated memory is still 136.3MB. Free memory was 81.8MB in the beginning and 78.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 522.91ms. Allocated memory is still 136.3MB. Free memory was 78.4MB in the beginning and 91.1MB in the end (delta: -12.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1631.71ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 90.3MB in the beginning and 119.4MB in the end (delta: -29.1MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 163.6MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short25 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 144. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed long int var_1_8 = -1; [L30] signed long int var_1_9 = 50; [L31] signed char var_1_10 = 64; [L32] signed short int var_1_11 = 5; [L33] unsigned short int var_1_12 = 4; [L34] unsigned char var_1_13 = 1; [L35] unsigned short int var_1_14 = 49632; [L36] unsigned short int var_1_15 = 0; [L37] signed char var_1_16 = 50; [L38] float var_1_17 = 128.5; [L39] signed char var_1_18 = 2; [L40] signed char var_1_19 = 25; [L41] signed char var_1_20 = 10; [L42] signed char var_1_21 = 1; [L43] signed char var_1_22 = 8; [L44] unsigned long int var_1_23 = 25; [L45] unsigned short int var_1_24 = 32; [L46] unsigned long int var_1_25 = 16; [L47] signed long int var_1_26 = 50; [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L89] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L90] var_1_3 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L91] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L92] var_1_4 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L93] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L94] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L95] var_1_5 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L96] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L97] var_1_6 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L98] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L99] var_1_8 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L100] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L101] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L102] var_1_9 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L105] var_1_10 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L107] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L108] var_1_13 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L111] var_1_14 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L114] var_1_15 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L115] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L117] var_1_17 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L118] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L119] var_1_18 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L120] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L122] var_1_19 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L125] var_1_20 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L126] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L128] var_1_21 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L130] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L130] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L131] var_1_22 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L132] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L133] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L134] var_1_24 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L135] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L136] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L136] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L137] var_1_25 = __VERIFIER_nondet_ulong() [L138] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L139] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L152] RET updateVariables() [L153] CALL step() [L51] COND TRUE (- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4)) [L52] var_1_1 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L56] EXPR var_1_8 & var_1_9 VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L56] COND FALSE !(-4 > (var_1_8 & var_1_9)) [L59] COND FALSE !(var_1_1 > var_1_4) [L62] var_1_11 = ((((var_1_7) < (((16 - 32) + (64 + var_1_10)))) ? (var_1_7) : (((16 - 32) + (64 + var_1_10))))) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=4, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L64] COND TRUE \read(var_1_13) [L65] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L67] COND TRUE var_1_2 <= (((((var_1_3) < (var_1_17)) ? (var_1_3) : (var_1_17))) + var_1_1) [L68] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L76] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L77] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L81] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_8 & var_1_9)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L144-L145] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_8 & var_1_9)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((var_1_7) < (((16 - 32) + (64 + var_1_10)))) ? (var_1_7) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_2 <= (((((var_1_3) < (var_1_17)) ? (var_1_3) : (var_1_17))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_25)) ? (var_1_14) : (var_1_25))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < var_1_9) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=32767, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=49637, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 33, 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, 358 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 243 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4224/4224 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 05:02:22,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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_8cd115af-3a36-41e8-8a71-429ae90878bd/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 a1c694b535a0db632a25942de489387c8249c42f83b73f06ffeb76130c0a4677 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:02:24,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:02:24,249 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:02:24,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:02:24,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:02:24,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:02:24,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:02:24,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:02:24,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:02:24,286 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:02:24,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:02:24,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:02:24,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:02:24,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:02:24,288 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:02:24,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:02:24,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:02:24,290 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:02:24,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:02:24,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:02:24,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:02:24,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:02:24,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:02:24,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:02:24,293 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:02:24,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:02:24,294 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:02:24,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:02:24,295 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:02:24,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:02:24,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:02:24,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:02:24,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:02:24,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:02:24,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:02:24,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:02:24,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:02:24,298 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:02:24,298 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:02:24,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:02:24,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:02:24,299 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:02:24,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:02:24,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:02:24,299 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:02:24,299 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_8cd115af-3a36-41e8-8a71-429ae90878bd/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_8cd115af-3a36-41e8-8a71-429ae90878bd/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 -> a1c694b535a0db632a25942de489387c8249c42f83b73f06ffeb76130c0a4677 [2023-11-29 05:02:24,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:02:24,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:02:24,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:02:24,623 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:02:24,624 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:02:24,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i [2023-11-29 05:02:27,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:02:27,647 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:02:27,648 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i [2023-11-29 05:02:27,657 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/data/1f0461a59/ba1db6f9f1e84a599d96777c1f376bf9/FLAGb6c632062 [2023-11-29 05:02:27,670 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/data/1f0461a59/ba1db6f9f1e84a599d96777c1f376bf9 [2023-11-29 05:02:27,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:02:27,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:02:27,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:02:27,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:02:27,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:02:27,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:27,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e96cc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27, skipping insertion in model container [2023-11-29 05:02:27,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:27,707 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:02:27,828 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_8cd115af-3a36-41e8-8a71-429ae90878bd/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i[913,926] [2023-11-29 05:02:27,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:02:27,903 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:02:27,913 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_8cd115af-3a36-41e8-8a71-429ae90878bd/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i[913,926] [2023-11-29 05:02:27,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:02:27,977 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:02:27,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27 WrapperNode [2023-11-29 05:02:27,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:02:27,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:02:27,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:02:27,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:02:27,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,044 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2023-11-29 05:02:28,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:02:28,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:02:28,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:02:28,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:02:28,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,077 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 05:02:28,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:02:28,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:02:28,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:02:28,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:02:28,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (1/1) ... [2023-11-29 05:02:28,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:02:28,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:02:28,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:02:28,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:02:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:02:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:02:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:02:28,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:02:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:02:28,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:02:28,263 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:02:28,265 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:02:41,628 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:02:41,675 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:02:41,675 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:02:41,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:02:41 BoogieIcfgContainer [2023-11-29 05:02:41,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:02:41,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:02:41,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:02:41,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:02:41,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:02:27" (1/3) ... [2023-11-29 05:02:41,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d58edc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:02:41, skipping insertion in model container [2023-11-29 05:02:41,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:02:27" (2/3) ... [2023-11-29 05:02:41,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d58edc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:02:41, skipping insertion in model container [2023-11-29 05:02:41,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:02:41" (3/3) ... [2023-11-29 05:02:41,684 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-43.i [2023-11-29 05:02:41,698 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:02:41,698 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:02:41,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:02:41,744 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;@b9a6911, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:02:41,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:02:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 05:02:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-11-29 05:02:41,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:02:41,764 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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 05:02:41,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:02:41,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:02:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1058424197, now seen corresponding path program 1 times [2023-11-29 05:02:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:02:41,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833119692] [2023-11-29 05:02:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:02:41,782 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 05:02:41,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:02:41,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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 05:02:41,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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 05:02:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:42,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:02:42,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:02:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2023-11-29 05:02:42,444 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:02:42,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:02:42,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833119692] [2023-11-29 05:02:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833119692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:02:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:02:42,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:02:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170294] [2023-11-29 05:02:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:02:42,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:02:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:02:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:02:42,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:02:42,485 INFO L87 Difference]: Start difference. First operand has 74 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-29 05:02:46,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:02:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:02:46,256 INFO L93 Difference]: Finished difference Result 145 states and 267 transitions. [2023-11-29 05:02:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:02:46,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 196 [2023-11-29 05:02:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:02:46,325 INFO L225 Difference]: With dead ends: 145 [2023-11-29 05:02:46,325 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 05:02:46,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 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 05:02:46,331 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:02:46,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 05:02:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 05:02:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-29 05:02:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 05:02:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 113 transitions. [2023-11-29 05:02:46,382 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 113 transitions. Word has length 196 [2023-11-29 05:02:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:02:46,382 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 113 transitions. [2023-11-29 05:02:46,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-29 05:02:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 113 transitions. [2023-11-29 05:02:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-11-29 05:02:46,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:02:46,388 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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 05:02:46,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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 05:02:46,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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 05:02:46,589 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:02:46,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:02:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2047636857, now seen corresponding path program 1 times [2023-11-29 05:02:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:02:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059455787] [2023-11-29 05:02:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:02:46,591 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 05:02:46,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:02:46,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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 05:02:46,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cd115af-3a36-41e8-8a71-429ae90878bd/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 05:02:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:47,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 05:02:47,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:10,735 WARN L293 SmtUtils]: Spent 5.38s 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 05:03:22,758 WARN L293 SmtUtils]: Spent 8.08s 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 05:04:15,716 WARN L293 SmtUtils]: Spent 18.19s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:04:32,420 WARN L293 SmtUtils]: Spent 8.09s 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 05:04:51,622 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 05:05:01,596 WARN L293 SmtUtils]: Spent 5.32s 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 05:05:16,757 WARN L293 SmtUtils]: Spent 8.10s 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 05:05:24,271 WARN L293 SmtUtils]: Spent 7.51s 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 05:05:37,579 WARN L293 SmtUtils]: Spent 6.32s 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 05:05:52,508 WARN L293 SmtUtils]: Spent 6.89s 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 05:06:00,067 WARN L293 SmtUtils]: Spent 7.56s 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 05:07:17,924 WARN L293 SmtUtils]: Spent 46.46s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:07:24,320 WARN L293 SmtUtils]: Spent 6.38s 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 05:07:32,532 WARN L293 SmtUtils]: Spent 6.23s 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 05:07:42,611 WARN L293 SmtUtils]: Spent 8.10s 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 05:08:06,941 WARN L293 SmtUtils]: Spent 7.12s 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 05:08:15,003 WARN L293 SmtUtils]: Spent 8.06s 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 05:08:23,193 WARN L293 SmtUtils]: Spent 8.19s 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 05:08:31,683 WARN L854 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_12~0) (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 05:08:43,081 WARN L293 SmtUtils]: Spent 8.32s 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 05:08:51,390 WARN L293 SmtUtils]: Spent 8.31s 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 05:08:59,686 WARN L293 SmtUtils]: Spent 8.29s 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 05:09:07,982 WARN L293 SmtUtils]: Spent 8.30s 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 05:09:16,190 WARN L293 SmtUtils]: Spent 8.21s 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 05:09:24,492 WARN L293 SmtUtils]: Spent 8.30s 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 05:09:32,854 WARN L293 SmtUtils]: Spent 8.36s 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 05:09:41,080 WARN L293 SmtUtils]: Spent 8.23s 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 05:09:49,379 WARN L293 SmtUtils]: Spent 8.30s 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 05:09:57,684 WARN L293 SmtUtils]: Spent 8.30s 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 05:10:05,913 WARN L293 SmtUtils]: Spent 8.23s 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 05:10:14,228 WARN L293 SmtUtils]: Spent 8.31s 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 05:10:22,532 WARN L293 SmtUtils]: Spent 8.30s 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 05:10:30,832 WARN L293 SmtUtils]: Spent 8.30s 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 05:10:39,163 WARN L293 SmtUtils]: Spent 8.33s 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 05:10:47,460 WARN L293 SmtUtils]: Spent 8.30s 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 05:10:55,765 WARN L293 SmtUtils]: Spent 8.30s 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 05:11:04,069 WARN L293 SmtUtils]: Spent 8.30s 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 05:11:12,381 WARN L293 SmtUtils]: Spent 8.31s 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 05:11:20,725 WARN L293 SmtUtils]: Spent 8.34s 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 05:11:29,053 WARN L293 SmtUtils]: Spent 8.33s 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 05:11:38,080 WARN L293 SmtUtils]: Spent 9.03s 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 05:11:46,442 WARN L293 SmtUtils]: Spent 8.36s 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 05:11:54,794 WARN L293 SmtUtils]: Spent 8.35s 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 05:12:03,184 WARN L293 SmtUtils]: Spent 8.39s 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 05:12:11,542 WARN L293 SmtUtils]: Spent 8.36s 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 05:12:19,873 WARN L293 SmtUtils]: Spent 8.33s 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 05:12:28,241 WARN L293 SmtUtils]: Spent 8.37s 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 05:12:32,328 WARN L854 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_12~0) (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (let ((.cse2 (fp.lt c_~var_1_3~0 c_~var_1_17~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0))) (or (and (fp.leq .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_17~0) c_~var_1_1~0)) (not .cse2)) (and .cse2 (fp.leq .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) c_~var_1_1~0))))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse12 ((_ sign_extend 24) c_~var_1_18~0)) (.cse8 ((_ sign_extend 24) c_~var_1_19~0)) (.cse7 ((_ sign_extend 24) c_~var_1_10~0))) (let ((.cse6 (= c_~var_1_16~0 ((_ extract 7 0) .cse7))) (.cse9 ((_ sign_extend 24) c_~var_1_20~0)) (.cse3 (bvslt .cse12 .cse8))) (or (and (not .cse3) (let ((.cse4 (bvadd .cse8 .cse9))) (let ((.cse5 (bvslt .cse7 .cse4))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) .cse4)) (not .cse5)) (and .cse6 .cse5))))) (and (let ((.cse11 (bvadd .cse12 .cse9))) (let ((.cse10 (bvslt .cse7 .cse11))) (or (and (not .cse10) (= ((_ extract 7 0) .cse11) c_~var_1_16~0)) (and .cse6 .cse10)))) .cse3)))) (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse14 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse13)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse14))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse13))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse14)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 05:12:36,415 WARN L876 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_12~0) (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (let ((.cse2 (fp.lt c_~var_1_3~0 c_~var_1_17~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0))) (or (and (fp.leq .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_17~0) c_~var_1_1~0)) (not .cse2)) (and .cse2 (fp.leq .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) c_~var_1_1~0))))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse12 ((_ sign_extend 24) c_~var_1_18~0)) (.cse8 ((_ sign_extend 24) c_~var_1_19~0)) (.cse7 ((_ sign_extend 24) c_~var_1_10~0))) (let ((.cse6 (= c_~var_1_16~0 ((_ extract 7 0) .cse7))) (.cse9 ((_ sign_extend 24) c_~var_1_20~0)) (.cse3 (bvslt .cse12 .cse8))) (or (and (not .cse3) (let ((.cse4 (bvadd .cse8 .cse9))) (let ((.cse5 (bvslt .cse7 .cse4))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) .cse4)) (not .cse5)) (and .cse6 .cse5))))) (and (let ((.cse11 (bvadd .cse12 .cse9))) (let ((.cse10 (bvslt .cse7 .cse11))) (or (and (not .cse10) (= ((_ extract 7 0) .cse11) c_~var_1_16~0)) (and .cse6 .cse10)))) .cse3)))) (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse14 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse13)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse14))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse13))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse14)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-29 05:12:44,834 WARN L293 SmtUtils]: Spent 8.37s 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 05:12:53,207 WARN L293 SmtUtils]: Spent 8.37s 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 05:13:01,587 WARN L293 SmtUtils]: Spent 8.38s 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 05:13:09,919 WARN L293 SmtUtils]: Spent 8.33s 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 05:13:18,161 WARN L293 SmtUtils]: Spent 8.24s 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 05:13:26,493 WARN L293 SmtUtils]: Spent 8.33s 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 05:13:34,819 WARN L293 SmtUtils]: Spent 8.33s 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 05:13:43,074 WARN L293 SmtUtils]: Spent 8.25s 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 05:13:51,414 WARN L293 SmtUtils]: Spent 8.34s 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 05:13:59,756 WARN L293 SmtUtils]: Spent 8.34s 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 05:14:08,023 WARN L293 SmtUtils]: Spent 8.27s 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 05:14:16,358 WARN L293 SmtUtils]: Spent 8.33s 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 05:14:24,706 WARN L293 SmtUtils]: Spent 8.35s 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 05:14:33,041 WARN L293 SmtUtils]: Spent 8.33s 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 05:14:41,370 WARN L293 SmtUtils]: Spent 8.33s 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 05:14:49,698 WARN L293 SmtUtils]: Spent 8.33s 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 05:14:58,018 WARN L293 SmtUtils]: Spent 8.32s 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 05:15:06,347 WARN L293 SmtUtils]: Spent 8.33s 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 05:15:14,681 WARN L293 SmtUtils]: Spent 8.33s 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 05:15:23,013 WARN L293 SmtUtils]: Spent 8.33s 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 05:15:31,357 WARN L293 SmtUtils]: Spent 8.34s 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 05:15:39,705 WARN L293 SmtUtils]: Spent 8.35s 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 05:15:48,036 WARN L293 SmtUtils]: Spent 8.33s 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 05:15:56,370 WARN L293 SmtUtils]: Spent 8.33s 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 05:16:04,704 WARN L293 SmtUtils]: Spent 8.33s 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 05:16:13,042 WARN L293 SmtUtils]: Spent 8.34s 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 05:16:21,372 WARN L293 SmtUtils]: Spent 8.33s 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 05:16:29,704 WARN L293 SmtUtils]: Spent 8.33s 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 05:16:38,057 WARN L293 SmtUtils]: Spent 8.35s 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 05:16:46,435 WARN L293 SmtUtils]: Spent 8.37s 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 05:16:50,516 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 16) c_~var_1_14~0)) (.cse2 ((_ zero_extend 16) c_~var_1_24~0)) (.cse3 ((_ sign_extend 24) c_~var_1_10~0))) (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) .cse0)) c_~var_1_12~0) (let ((.cse1 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse1)) (and .cse1 (= c_~var_1_5~0 c_~var_1_1~0)))) (bvslt (bvneg (bvadd (bvneg .cse2) .cse0)) .cse3) (= c_~var_1_23~0 (bvadd .cse2 (_ bv4 32) ((_ sign_extend 24) c_~var_1_22~0))) (let ((.cse5 (fp.lt c_~var_1_3~0 c_~var_1_17~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0))) (or (and (fp.leq .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_17~0) c_~var_1_1~0)) (not .cse5)) (and .cse5 (fp.leq .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) c_~var_1_1~0))))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse14 ((_ sign_extend 24) c_~var_1_18~0)) (.cse10 ((_ sign_extend 24) c_~var_1_19~0))) (let ((.cse9 (= c_~var_1_16~0 ((_ extract 7 0) .cse3))) (.cse11 ((_ sign_extend 24) c_~var_1_20~0)) (.cse6 (bvslt .cse14 .cse10))) (or (and (not .cse6) (let ((.cse7 (bvadd .cse10 .cse11))) (let ((.cse8 (bvslt .cse3 .cse7))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) .cse7)) (not .cse8)) (and .cse9 .cse8))))) (and (let ((.cse13 (bvadd .cse14 .cse11))) (let ((.cse12 (bvslt .cse3 .cse13))) (or (and (not .cse12) (= ((_ extract 7 0) .cse13) c_~var_1_16~0)) (and .cse9 .cse12)))) .cse6)))) (let ((.cse15 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse16 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse15)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse16))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse15))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse16)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 05:16:54,598 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 16) c_~var_1_14~0)) (.cse2 ((_ zero_extend 16) c_~var_1_24~0)) (.cse3 ((_ sign_extend 24) c_~var_1_10~0))) (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) .cse0)) c_~var_1_12~0) (let ((.cse1 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse1)) (and .cse1 (= c_~var_1_5~0 c_~var_1_1~0)))) (bvslt (bvneg (bvadd (bvneg .cse2) .cse0)) .cse3) (= c_~var_1_23~0 (bvadd .cse2 (_ bv4 32) ((_ sign_extend 24) c_~var_1_22~0))) (let ((.cse5 (fp.lt c_~var_1_3~0 c_~var_1_17~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0))) (or (and (fp.leq .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_17~0) c_~var_1_1~0)) (not .cse5)) (and .cse5 (fp.leq .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) c_~var_1_1~0))))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse14 ((_ sign_extend 24) c_~var_1_18~0)) (.cse10 ((_ sign_extend 24) c_~var_1_19~0))) (let ((.cse9 (= c_~var_1_16~0 ((_ extract 7 0) .cse3))) (.cse11 ((_ sign_extend 24) c_~var_1_20~0)) (.cse6 (bvslt .cse14 .cse10))) (or (and (not .cse6) (let ((.cse7 (bvadd .cse10 .cse11))) (let ((.cse8 (bvslt .cse3 .cse7))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) .cse7)) (not .cse8)) (and .cse9 .cse8))))) (and (let ((.cse13 (bvadd .cse14 .cse11))) (let ((.cse12 (bvslt .cse3 .cse13))) (or (and (not .cse12) (= ((_ extract 7 0) .cse13) c_~var_1_16~0)) (and .cse9 .cse12)))) .cse6)))) (let ((.cse15 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse16 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse15)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse16))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse15))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse16)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 05:17:03,010 WARN L293 SmtUtils]: Spent 8.35s 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 05:17:11,370 WARN L293 SmtUtils]: Spent 8.36s 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 05:17:19,715 WARN L293 SmtUtils]: Spent 8.34s 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 05:17:28,061 WARN L293 SmtUtils]: Spent 8.35s 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 05:17:36,306 WARN L293 SmtUtils]: Spent 8.24s 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)