./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:22:35,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:22:36,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:22:36,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:22:36,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:22:36,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:22:36,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:22:36,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:22:36,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:22:36,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:22:36,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:22:36,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:22:36,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:22:36,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:22:36,051 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:22:36,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:22:36,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:22:36,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:22:36,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:22:36,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:22:36,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:22:36,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:22:36,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:22:36,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:22:36,053 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:22:36,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:22:36,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:22:36,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:22:36,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:22:36,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:22:36,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:22:36,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:22:36,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:22:36,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:22:36,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:22:36,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:22:36,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:22:36,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:22:36,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:22:36,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:22:36,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:22:36,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:22:36,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:22:36,055 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2025-02-06 03:22:36,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:22:36,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:22:36,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:22:36,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:22:36,301 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:22:36,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2025-02-06 03:22:37,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f882194c/a5e30f4ba93d48c88495d2d957a76539/FLAG6b261d0da [2025-02-06 03:22:37,784 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:22:37,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2025-02-06 03:22:37,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f882194c/a5e30f4ba93d48c88495d2d957a76539/FLAG6b261d0da [2025-02-06 03:22:37,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f882194c/a5e30f4ba93d48c88495d2d957a76539 [2025-02-06 03:22:37,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:22:37,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:22:37,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:22:37,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:22:37,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:22:37,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:22:37" (1/1) ... [2025-02-06 03:22:37,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f5e9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:37, skipping insertion in model container [2025-02-06 03:22:37,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:22:37" (1/1) ... [2025-02-06 03:22:37,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:22:37,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2025-02-06 03:22:38,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:22:38,017 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:22:38,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2025-02-06 03:22:38,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:22:38,080 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:22:38,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38 WrapperNode [2025-02-06 03:22:38,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:22:38,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:22:38,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:22:38,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:22:38,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,140 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 515 [2025-02-06 03:22:38,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:22:38,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:22:38,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:22:38,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:22:38,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,172 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2025-02-06 03:22:38,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:22:38,191 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:22:38,191 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:22:38,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:22:38,192 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (1/1) ... [2025-02-06 03:22:38,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:22:38,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:38,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:22:38,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:22:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:22:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:22:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:22:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:22:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:22:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:22:38,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:22:38,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:22:38,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:22:38,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:22:38,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:22:38,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:22:38,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:22:38,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:22:38,345 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:22:38,346 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:22:38,706 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise106#1;havoc property_#t~mem107#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite134#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short123#1;havoc property_#t~ite133#1;havoc property_#t~mem129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~short135#1;havoc property_#t~mem136#1;havoc property_#t~ite146#1;havoc property_#t~mem137#1;havoc property_#t~ite143#1;havoc property_#t~mem140#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~short147#1; [2025-02-06 03:22:38,759 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-02-06 03:22:38,760 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:22:38,774 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:22:38,774 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 03:22:38,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:38 BoogieIcfgContainer [2025-02-06 03:22:38,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:22:38,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:22:38,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:22:38,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:22:38,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:22:37" (1/3) ... [2025-02-06 03:22:38,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c074c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:22:38, skipping insertion in model container [2025-02-06 03:22:38,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:38" (2/3) ... [2025-02-06 03:22:38,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c074c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:22:38, skipping insertion in model container [2025-02-06 03:22:38,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:38" (3/3) ... [2025-02-06 03:22:38,781 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2025-02-06 03:22:38,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:22:38,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-98.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:22:38,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:22:38,847 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51b126af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:22:38,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:22:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:22:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:22:38,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:38,859 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:38,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:38,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:38,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1762557731, now seen corresponding path program 1 times [2025-02-06 03:22:38,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:38,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665571808] [2025-02-06 03:22:38,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:38,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:22:38,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:22:38,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:38,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:22:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665571808] [2025-02-06 03:22:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665571808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996931417] [2025-02-06 03:22:39,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:39,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:39,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:39,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:22:39,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:22:39,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:22:39,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:22:39,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:39,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:39,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:22:39,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:22:39,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:39,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996931417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:39,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:22:39,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:22:39,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91262166] [2025-02-06 03:22:39,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:39,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:22:39,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:39,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:22:39,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:22:39,370 INFO L87 Difference]: Start difference. First operand has 122 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:22:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:39,392 INFO L93 Difference]: Finished difference Result 238 states and 370 transitions. [2025-02-06 03:22:39,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:22:39,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-02-06 03:22:39,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:39,399 INFO L225 Difference]: With dead ends: 238 [2025-02-06 03:22:39,399 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 03:22:39,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:22:39,403 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:39,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 03:22:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 03:22:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:22:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2025-02-06 03:22:39,431 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 143 [2025-02-06 03:22:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:39,432 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2025-02-06 03:22:39,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:22:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2025-02-06 03:22:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:22:39,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:39,434 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:39,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:22:39,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:22:39,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:39,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -252433960, now seen corresponding path program 1 times [2025-02-06 03:22:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556629798] [2025-02-06 03:22:39,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:39,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:22:39,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:22:39,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:39,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:22:39,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547243616] [2025-02-06 03:22:39,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:39,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:39,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:39,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:22:39,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:22:39,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:22:40,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:22:40,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:40,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:22:40,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:22:40,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:22:40,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:22:40,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:22:40,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:22:40,502 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:22:40,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:22:40,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:22:40,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:40,707 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 03:22:40,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:22:40,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:22:40 BoogieIcfgContainer [2025-02-06 03:22:40,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:22:40,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:22:40,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:22:40,768 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:22:40,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:38" (3/4) ... [2025-02-06 03:22:40,771 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:22:40,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:22:40,773 INFO L158 Benchmark]: Toolchain (without parser) took 2961.13ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 73.4MB in the end (delta: 39.9MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-02-06 03:22:40,773 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:22:40,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.56ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 97.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:22:40,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.90ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 93.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:22:40,775 INFO L158 Benchmark]: Boogie Preprocessor took 49.53ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:22:40,775 INFO L158 Benchmark]: IcfgBuilder took 583.79ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 56.8MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:22:40,775 INFO L158 Benchmark]: TraceAbstraction took 1991.34ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 73.5MB in the end (delta: -17.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:22:40,775 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 73.4MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:22:40,776 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.56ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 97.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.90ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 93.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.53ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 583.79ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 56.8MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1991.34ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 73.5MB in the end (delta: -17.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 73.4MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryArithmeticDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L34] unsigned long int last_1_unsigned_long_int_Array_0_4_ = 500; VAL [double_Array_0={4:0}, isInitial=0, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] EXPR unsigned_long_int_Array_0[4] [L91] last_1_unsigned_long_int_Array_0_4_ = unsigned_long_int_Array_0[4] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L61] double_Array_0[0][0][0] = __VERIFIER_nondet_double() [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] CALL assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] RET assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L63] double_Array_0[1][0][0] = __VERIFIER_nondet_double() [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] CALL assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] RET assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L65] double_Array_0[0][1][0] = __VERIFIER_nondet_double() [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] double_Array_0[1][1][0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] double_Array_0[1][0][1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] double_Array_0[0][1][1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L74] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L78] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L102] RET updateVariables() [L103] CALL step() [L38] EXPR double_Array_0[0][1][1] [L38] EXPR double_Array_0[1][0][1] [L38] double_Array_0[1][1][1] = (double_Array_0[0][1][1] - double_Array_0[1][0][1]) [L39] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] COND FALSE !(((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) [L46] EXPR unsigned_long_int_Array_0[2] [L46] unsigned_long_int_Array_0[4] = unsigned_long_int_Array_0[2] [L48] EXPR unsigned_long_int_Array_0[4] [L48] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR signed_long_int_Array_0[0] [L48] unsigned long int stepLocal_0 = (unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0]; [L49] COND FALSE !(8 < stepLocal_0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] EXPR double_Array_0[0][1][1] [L52] EXPR double_Array_0[1][0][0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] COND FALSE !(double_Array_0[0][1][1] < double_Array_0[1][0][0]) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR double_Array_0[1][1][1] [L94] EXPR double_Array_0[0][1][1] [L94] EXPR double_Array_0[1][0][1] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94-L95] return (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L19] reach_error() VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 172 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:22:40,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:22:42,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:22:42,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:22:42,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:22:42,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:22:42,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:22:42,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:22:42,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:22:42,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:22:42,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:22:42,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:22:42,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:22:42,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:22:42,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:22:42,764 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:22:42,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:22:42,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:22:42,765 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:22:42,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:22:42,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:22:42,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:22:42,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:22:42,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:22:42,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:22:42,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:22:42,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:22:42,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:22:42,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:22:42,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:22:42,767 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:22:42,768 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:22:42,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:22:42,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:22:42,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:22:42,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:22:42,768 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2025-02-06 03:22:43,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:22:43,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:22:43,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:22:43,032 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:22:43,033 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:22:43,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2025-02-06 03:22:44,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5e77a7d7/9c2ad4eeec234de58b8d39ccd715cb11/FLAGf7c59bd9b [2025-02-06 03:22:44,399 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:22:44,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2025-02-06 03:22:44,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5e77a7d7/9c2ad4eeec234de58b8d39ccd715cb11/FLAGf7c59bd9b [2025-02-06 03:22:44,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5e77a7d7/9c2ad4eeec234de58b8d39ccd715cb11 [2025-02-06 03:22:44,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:22:44,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:22:44,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:22:44,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:22:44,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:22:44,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ff8a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44, skipping insertion in model container [2025-02-06 03:22:44,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:22:44,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2025-02-06 03:22:44,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:22:44,635 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:22:44,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2025-02-06 03:22:44,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:22:44,725 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:22:44,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44 WrapperNode [2025-02-06 03:22:44,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:22:44,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:22:44,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:22:44,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:22:44,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,788 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2025-02-06 03:22:44,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:22:44,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:22:44,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:22:44,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:22:44,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,839 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2025-02-06 03:22:44,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:22:44,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:22:44,888 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:22:44,888 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:22:44,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (1/1) ... [2025-02-06 03:22:44,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:22:44,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:44,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:22:44,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:22:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:22:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:22:44,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:22:44,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:22:44,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:22:44,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:22:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:22:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:22:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:22:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:22:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:22:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:22:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:22:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:22:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:22:45,056 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:22:45,057 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:22:53,248 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~short121#1;havoc property_#t~ite131#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~ite144#1;havoc property_#t~mem135#1;havoc property_#t~ite141#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short145#1; [2025-02-06 03:22:53,274 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-02-06 03:22:53,274 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:22:53,284 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:22:53,285 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:22:53,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:53 BoogieIcfgContainer [2025-02-06 03:22:53,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:22:53,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:22:53,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:22:53,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:22:53,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:22:44" (1/3) ... [2025-02-06 03:22:53,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9935ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:22:53, skipping insertion in model container [2025-02-06 03:22:53,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:44" (2/3) ... [2025-02-06 03:22:53,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9935ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:22:53, skipping insertion in model container [2025-02-06 03:22:53,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:53" (3/3) ... [2025-02-06 03:22:53,293 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2025-02-06 03:22:53,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:22:53,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-98.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:22:53,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:22:53,346 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5889646f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:22:53,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:22:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:22:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:22:53,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:53,357 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:53,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:53,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash -316690005, now seen corresponding path program 1 times [2025-02-06 03:22:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:53,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462731336] [2025-02-06 03:22:53,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:53,368 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 [2025-02-06 03:22:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:53,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2025-02-06 03:22:53,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2025-02-06 03:22:53,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:22:53,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:22:53,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:53,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:53,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:22:53,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-02-06 03:22:53,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:53,854 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:53,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462731336] [2025-02-06 03:22:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462731336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:53,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:53,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:22:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920009923] [2025-02-06 03:22:53,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:53,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:22:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:53,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:22:53,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:22:53,877 INFO L87 Difference]: Start difference. First operand has 116 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:22:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:53,901 INFO L93 Difference]: Finished difference Result 226 states and 354 transitions. [2025-02-06 03:22:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:22:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-02-06 03:22:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:53,907 INFO L225 Difference]: With dead ends: 226 [2025-02-06 03:22:53,907 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 03:22:53,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:22:53,911 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:53,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 03:22:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-06 03:22:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:22:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2025-02-06 03:22:53,958 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 141 [2025-02-06 03:22:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:53,959 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2025-02-06 03:22:53,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:22:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2025-02-06 03:22:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:22:53,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:53,963 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:53,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:22:54,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2025-02-06 03:22:54,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:54,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 476743072, now seen corresponding path program 1 times [2025-02-06 03:22:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891936220] [2025-02-06 03:22:54,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:54,165 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 [2025-02-06 03:22:54,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:54,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2025-02-06 03:22:54,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2025-02-06 03:22:54,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:22:54,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:22:54,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:54,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:54,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:22:54,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:55,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:55,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-02-06 03:22:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:22:55,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:55,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:55,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891936220] [2025-02-06 03:22:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891936220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:55,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:55,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:22:55,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525364527] [2025-02-06 03:22:55,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:55,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:22:55,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:55,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:22:55,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:22:55,134 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:23:00,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:23:01,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:23:05,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:23:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:23:05,498 INFO L93 Difference]: Finished difference Result 224 states and 330 transitions. [2025-02-06 03:23:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:23:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-02-06 03:23:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:23:05,505 INFO L225 Difference]: With dead ends: 224 [2025-02-06 03:23:05,505 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:23:05,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:23:05,506 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 133 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:23:05,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 482 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 10.2s Time] [2025-02-06 03:23:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:23:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-02-06 03:23:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:23:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2025-02-06 03:23:05,515 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 141 [2025-02-06 03:23:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:23:05,516 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2025-02-06 03:23:05,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:23:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2025-02-06 03:23:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:23:05,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:23:05,518 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:23:05,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:23:05,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2025-02-06 03:23:05,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:23:05,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:23:05,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1740899586, now seen corresponding path program 1 times [2025-02-06 03:23:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:23:05,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096321254] [2025-02-06 03:23:05,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:05,720 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 [2025-02-06 03:23:05,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:23:05,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2025-02-06 03:23:05,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:23:05,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:23:06,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:23:06,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:23:06,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:23:06,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:23:06,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:23:06,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:23:06,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-02-06 03:23:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-02-06 03:23:06,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:23:06,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:23:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096321254] [2025-02-06 03:23:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096321254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:23:06,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:23:06,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:23:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992154803] [2025-02-06 03:23:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:23:06,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:23:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:23:06,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:23:06,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:23:06,745 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:23:11,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:23:15,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:23:18,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:23:23,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:23:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:23:23,667 INFO L93 Difference]: Finished difference Result 224 states and 328 transitions. [2025-02-06 03:23:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:23:23,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-02-06 03:23:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:23:23,670 INFO L225 Difference]: With dead ends: 224 [2025-02-06 03:23:23,670 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:23:23,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:23:23,671 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 125 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:23:23,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 475 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 2 Unknown, 0 Unchecked, 16.8s Time] [2025-02-06 03:23:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:23:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-02-06 03:23:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:23:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2025-02-06 03:23:23,678 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 143 [2025-02-06 03:23:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:23:23,678 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2025-02-06 03:23:23,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:23:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2025-02-06 03:23:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:23:23,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:23:23,680 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:23:23,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:23:23,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2025-02-06 03:23:23,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:23:23,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:23:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash -415358657, now seen corresponding path program 1 times [2025-02-06 03:23:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:23:23,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018010634] [2025-02-06 03:23:23,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:23,882 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 [2025-02-06 03:23:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:23:23,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2025-02-06 03:23:23,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:23:23,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:23:24,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:23:24,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:23:24,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:23:24,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:23:24,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:23:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-02-06 03:23:24,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:23:24,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:23:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018010634] [2025-02-06 03:23:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018010634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:23:24,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:23:24,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:23:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909520249] [2025-02-06 03:23:24,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:23:24,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:23:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:23:24,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:23:24,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:23:24,408 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:23:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:23:24,937 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2025-02-06 03:23:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:23:24,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 145 [2025-02-06 03:23:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:23:24,945 INFO L225 Difference]: With dead ends: 227 [2025-02-06 03:23:24,945 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 03:23:24,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:23:24,946 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:23:24,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 677 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:23:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 03:23:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-02-06 03:23:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:23:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2025-02-06 03:23:24,960 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 145 [2025-02-06 03:23:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:23:24,960 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2025-02-06 03:23:24,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:23:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2025-02-06 03:23:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:23:24,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:23:24,962 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:23:24,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:23:25,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2025-02-06 03:23:25,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:23:25,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:23:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1353890272, now seen corresponding path program 1 times [2025-02-06 03:23:25,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:23:25,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10862112] [2025-02-06 03:23:25,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:25,164 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 [2025-02-06 03:23:25,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:23:25,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2025-02-06 03:23:25,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:23:25,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.