./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-51.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 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:23:05,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:23:05,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:23:05,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:23:05,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:23:05,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:23:05,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:23:05,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:23:05,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:23:05,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:23:05,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:23:05,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:23:05,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:23:05,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:23:05,090 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:23:05,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:23:05,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:05,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:05,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:05,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:05,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:23:05,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:05,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:05,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:05,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:05,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:23:05,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:23:05,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:23:05,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:23:05,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:23:05,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:23:05,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:23:05,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:23:05,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:23:05,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:23:05,095 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 -> 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c [2025-01-09 15:23:05,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:23:05,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:23:05,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:23:05,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:23:05,315 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:23:05,316 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-51.i [2025-01-09 15:23:06,449 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2862e806/0ecde1c5c0a247cdbb01b513bec73771/FLAG33061f50d [2025-01-09 15:23:06,715 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:23:06,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-51.i [2025-01-09 15:23:06,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2862e806/0ecde1c5c0a247cdbb01b513bec73771/FLAG33061f50d [2025-01-09 15:23:07,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2862e806/0ecde1c5c0a247cdbb01b513bec73771 [2025-01-09 15:23:07,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:23:07,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:23:07,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:23:07,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:23:07,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:23:07,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475e2876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07, skipping insertion in model container [2025-01-09 15:23:07,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:23:07,124 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-51.i[916,929] [2025-01-09 15:23:07,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:23:07,181 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:23:07,188 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-51.i[916,929] [2025-01-09 15:23:07,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:23:07,220 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:23:07,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07 WrapperNode [2025-01-09 15:23:07,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:23:07,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:23:07,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:23:07,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:23:07,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,259 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-01-09 15:23:07,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:23:07,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:23:07,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:23:07,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:23:07,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,286 INFO L175 MemorySlicer]: Split 145 memory accesses to 5 slices as follows [2, 8, 49, 7, 79]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 1, 7]. The 18 writes are split as follows [0, 1, 7, 1, 9]. [2025-01-09 15:23:07,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:23:07,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:23:07,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:23:07,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:23:07,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (1/1) ... [2025-01-09 15:23:07,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:07,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:07,352 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-01-09 15:23:07,361 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-01-09 15:23:07,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:23:07,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:23:07,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:23:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:23:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:23:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:23:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:23:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:23:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:23:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:23:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:23:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:23:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:23:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:23:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:23:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:23:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:23:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:23:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:23:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:23:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:23:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:23:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:23:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:23:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:23:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:23:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:23:07,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:23:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:23:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:23:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:23:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:23:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:23:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:23:07,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:23:07,499 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:23:07,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:23:07,902 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-09 15:23:07,902 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:23:07,912 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:23:07,912 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:23:07,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:07 BoogieIcfgContainer [2025-01-09 15:23:07,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:23:07,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:23:07,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:23:07,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:23:07,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:23:07" (1/3) ... [2025-01-09 15:23:07,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ec6646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:23:07, skipping insertion in model container [2025-01-09 15:23:07,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:07" (2/3) ... [2025-01-09 15:23:07,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ec6646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:23:07, skipping insertion in model container [2025-01-09 15:23:07,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:07" (3/3) ... [2025-01-09 15:23:07,919 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-51.i [2025-01-09 15:23:07,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:23:07,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-51.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:23:07,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:23:07,979 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;@94d1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:23:07,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:23:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:23:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:23:07,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:07,989 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:07,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:07,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1165665747, now seen corresponding path program 1 times [2025-01-09 15:23:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120855227] [2025-01-09 15:23:07,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:08,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:23:08,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:23:08,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:08,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:23:08,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:08,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120855227] [2025-01-09 15:23:08,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120855227] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:23:08,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278532571] [2025-01-09 15:23:08,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:08,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:23:08,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:08,238 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-01-09 15:23:08,240 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-01-09 15:23:08,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:23:08,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:23:08,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:08,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:08,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:23:08,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:23:08,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:23:08,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278532571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:08,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:23:08,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:23:08,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932308433] [2025-01-09 15:23:08,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:08,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:23:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:08,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:23:08,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:23:08,475 INFO L87 Difference]: Start difference. First operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:23:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:08,497 INFO L93 Difference]: Finished difference Result 240 states and 376 transitions. [2025-01-09 15:23:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:23:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:23:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:08,503 INFO L225 Difference]: With dead ends: 240 [2025-01-09 15:23:08,503 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 15:23:08,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-01-09 15:23:08,506 INFO L435 NwaCegarLoop]: 176 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, 176 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-01-09 15:23:08,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 15:23:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 15:23:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:23:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 15:23:08,531 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2025-01-09 15:23:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:08,531 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 15:23:08,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:23:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 15:23:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:23:08,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:08,535 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:08,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:23:08,736 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-01-09 15:23:08,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:08,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash 312441807, now seen corresponding path program 1 times [2025-01-09 15:23:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:08,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038318547] [2025-01-09 15:23:08,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:08,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:23:08,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:23:08,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:08,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:23:09,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:09,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038318547] [2025-01-09 15:23:09,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038318547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:09,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:09,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:23:09,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370414525] [2025-01-09 15:23:09,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:09,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:23:09,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:09,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:23:09,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:23:09,034 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:23:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:09,058 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2025-01-09 15:23:09,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:23:09,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:23:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:09,060 INFO L225 Difference]: With dead ends: 239 [2025-01-09 15:23:09,060 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:23:09,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:23:09,061 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:09,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:23:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 15:23:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:23:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-01-09 15:23:09,068 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 149 [2025-01-09 15:23:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:09,069 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-01-09 15:23:09,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:23:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-01-09 15:23:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:23:09,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:09,075 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:09,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:23:09,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:09,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash -549391795, now seen corresponding path program 1 times [2025-01-09 15:23:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548304934] [2025-01-09 15:23:09,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:09,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:23:09,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:23:09,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:09,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:23:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548304934] [2025-01-09 15:23:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548304934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:09,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:09,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:23:09,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564838163] [2025-01-09 15:23:09,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:09,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:23:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:09,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:23:09,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:23:09,379 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:23:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:09,407 INFO L93 Difference]: Finished difference Result 241 states and 353 transitions. [2025-01-09 15:23:09,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:23:09,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-01-09 15:23:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:09,409 INFO L225 Difference]: With dead ends: 241 [2025-01-09 15:23:09,409 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:23:09,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:23:09,410 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:09,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:23:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 15:23:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:23:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2025-01-09 15:23:09,421 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 149 [2025-01-09 15:23:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:09,422 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2025-01-09 15:23:09,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:23:09,422 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2025-01-09 15:23:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:23:09,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:09,426 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:09,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:23:09,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:09,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:09,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2120347650, now seen corresponding path program 1 times [2025-01-09 15:23:09,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:09,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606111084] [2025-01-09 15:23:09,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:09,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:09,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:23:09,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:23:09,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:09,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:23:09,564 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:23:09,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:23:09,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:23:09,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:09,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:23:09,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:23:09,714 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:23:09,715 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:23:09,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:23:09,719 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 15:23:09,779 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:23:09,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:23:09 BoogieIcfgContainer [2025-01-09 15:23:09,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:23:09,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:23:09,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:23:09,782 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:23:09,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:07" (3/4) ... [2025-01-09 15:23:09,783 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:23:09,784 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:23:09,784 INFO L158 Benchmark]: Toolchain (without parser) took 2759.91ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 77.5MB in the end (delta: 51.7MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2025-01-09 15:23:09,784 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:23:09,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.88ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 114.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:23:09,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.35ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 110.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:23:09,785 INFO L158 Benchmark]: Boogie Preprocessor took 57.58ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 105.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:23:09,785 INFO L158 Benchmark]: RCFGBuilder took 592.36ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 71.9MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:23:09,785 INFO L158 Benchmark]: TraceAbstraction took 1865.63ms. Allocated memory is still 167.8MB. Free memory was 71.5MB in the beginning and 77.6MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:23:09,786 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory was 77.6MB in the beginning and 77.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:23:09,787 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.88ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 114.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.35ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 110.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.58ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 105.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 592.36ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 71.9MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1865.63ms. Allocated memory is still 167.8MB. Free memory was 71.5MB in the beginning and 77.6MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory was 77.6MB in the beginning and 77.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -16 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -16 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L34] unsigned long int last_1_unsigned_long_int_Array_0_5_ = 8; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L104] isInitial = 1 [L105] FCALL initially() [L107] CALL updateLastVariables() [L97] EXPR unsigned_long_int_Array_0[5] [L97] last_1_unsigned_long_int_Array_0_5_ = unsigned_long_int_Array_0[5] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] double_Array_0[0] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] CALL assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] RET assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] double_Array_0[1] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] double_Array_0[2] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[2] [L73] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F [L73] EXPR double_Array_0[2] [L73] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] CALL assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] RET assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] double_Array_0[3] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[3] [L75] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F [L75] EXPR double_Array_0[3] [L75] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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 [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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 [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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 [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, 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] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L89] unsigned_long_int_Array_0[4] = __VERIFIER_nondet_ulong() [L90] EXPR unsigned_long_int_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[4] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[4] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L91] EXPR unsigned_long_int_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[4] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[4] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L92] unsigned_long_int_Array_0[6] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[6] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[6] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR unsigned_long_int_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[6] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[6] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L38] unsigned long int stepLocal_1 = - last_1_unsigned_long_int_Array_0_5_; [L39] EXPR unsigned_long_int_Array_0[3] [L39] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] EXPR ((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]) [L39] EXPR unsigned_long_int_Array_0[3] [L39] EXPR ((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, stepLocal_1=-8, unsigned_long_int_Array_0={7:0}] [L39] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] COND FALSE !((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != stepLocal_1) [L42] EXPR unsigned_long_int_Array_0[6] [L42] unsigned_long_int_Array_0[2] = unsigned_long_int_Array_0[6] [L44] EXPR unsigned_long_int_Array_0[2] [L44] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L44] COND TRUE unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2] [L45] EXPR BOOL_unsigned_char_Array_0[0] [L45] BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L45] BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) [L53] EXPR unsigned_long_int_Array_0[2] [L53] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[2]; [L54] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L61] EXPR double_Array_0[1] [L61] double_Array_0[4] = double_Array_0[1] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1])) [L100] EXPR double_Array_0[4] [L100] EXPR double_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6])))) && ((unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) ? ((unsigned_long_int_Array_0[2] < unsigned_long_int_Array_0[3]) ? (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[6])) : 1) : 1) : (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6])))) && ((unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) ? ((unsigned_long_int_Array_0[2] < unsigned_long_int_Array_0[3]) ? (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[6])) : 1) : 1) : (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100-L101] return ((BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6])))) && ((unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) ? ((unsigned_long_int_Array_0[2] < unsigned_long_int_Array_0[3]) ? (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[6])) : 1) : 1) : (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[4]))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1032 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 508 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 524 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 747 NumberOfCodeBlocks, 747 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 592 ConstructedInterpolants, 0 QuantifiedInterpolants, 596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2700/2736 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-01-09 15:23:09,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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-51.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 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:23:11,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:23:11,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:23:11,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:23:11,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:23:11,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:23:11,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:23:11,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:23:11,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:23:11,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:23:11,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:23:11,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:23:11,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:23:11,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:23:11,763 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:23:11,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:23:11,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:23:11,763 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:23:11,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:23:11,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:23:11,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:23:11,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:23:11,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:23:11,764 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:23:11,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:11,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:11,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:23:11,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:23:11,766 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:23:11,766 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:23:11,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:23:11,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:23:11,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:23:11,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:23:11,766 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 -> 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c [2025-01-09 15:23:11,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:23:11,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:23:11,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:23:11,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:23:11,994 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:23:11,994 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-51.i [2025-01-09 15:23:13,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a49e300f4/ecf816e28b1c4b068047e0a755986a94/FLAG0c3ad986b [2025-01-09 15:23:13,378 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:23:13,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-51.i [2025-01-09 15:23:13,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a49e300f4/ecf816e28b1c4b068047e0a755986a94/FLAG0c3ad986b [2025-01-09 15:23:13,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a49e300f4/ecf816e28b1c4b068047e0a755986a94 [2025-01-09 15:23:13,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:23:13,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:23:13,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:23:13,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:23:13,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:23:13,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb3ca49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13, skipping insertion in model container [2025-01-09 15:23:13,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:23:13,508 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-51.i[916,929] [2025-01-09 15:23:13,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:23:13,552 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:23:13,559 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-51.i[916,929] [2025-01-09 15:23:13,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:23:13,622 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:23:13,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13 WrapperNode [2025-01-09 15:23:13,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:23:13,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:23:13,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:23:13,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:23:13,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,660 INFO L138 Inliner]: procedures = 36, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 550 [2025-01-09 15:23:13,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:23:13,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:23:13,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:23:13,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:23:13,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,688 INFO L175 MemorySlicer]: Split 145 memory accesses to 5 slices as follows [2, 8, 49, 7, 79]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 1, 7]. The 18 writes are split as follows [0, 1, 7, 1, 9]. [2025-01-09 15:23:13,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:23:13,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:23:13,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:23:13,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:23:13,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (1/1) ... [2025-01-09 15:23:13,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:13,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:13,753 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-01-09 15:23:13,758 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-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:23:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:23:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:23:13,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:23:13,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:23:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:23:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:23:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:23:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:23:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:23:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:23:13,920 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:23:13,921 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:23:15,382 INFO L? ?]: Removed 151 outVars from TransFormulas that were not future-live. [2025-01-09 15:23:15,382 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:23:15,392 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:23:15,393 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:23:15,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:15 BoogieIcfgContainer [2025-01-09 15:23:15,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:23:15,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:23:15,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:23:15,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:23:15,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:23:13" (1/3) ... [2025-01-09 15:23:15,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776456f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:23:15, skipping insertion in model container [2025-01-09 15:23:15,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:13" (2/3) ... [2025-01-09 15:23:15,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776456f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:23:15, skipping insertion in model container [2025-01-09 15:23:15,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:15" (3/3) ... [2025-01-09 15:23:15,400 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-51.i [2025-01-09 15:23:15,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:23:15,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-51.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:23:15,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:23:15,462 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;@499571cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:23:15,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:23:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:23:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:23:15,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:15,474 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:15,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:15,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1165665747, now seen corresponding path program 1 times [2025-01-09 15:23:15,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:23:15,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612566629] [2025-01-09 15:23:15,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:15,487 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-01-09 15:23:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:23:15,489 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-01-09 15:23:15,491 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-01-09 15:23:15,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:23:15,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:23:15,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:15,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:15,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:23:15,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-01-09 15:23:15,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:23:15,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:23:15,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612566629] [2025-01-09 15:23:15,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612566629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:15,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:15,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:23:15,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692969754] [2025-01-09 15:23:15,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:15,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:23:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:23:15,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:23:15,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:23:15,907 INFO L87 Difference]: Start difference. First operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:23:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:15,936 INFO L93 Difference]: Finished difference Result 240 states and 376 transitions. [2025-01-09 15:23:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:23:15,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:23:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:15,942 INFO L225 Difference]: With dead ends: 240 [2025-01-09 15:23:15,943 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 15:23:15,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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-01-09 15:23:15,949 INFO L435 NwaCegarLoop]: 176 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, 176 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-01-09 15:23:15,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 15:23:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 15:23:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:23:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 15:23:15,983 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2025-01-09 15:23:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:15,983 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 15:23:15,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:23:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 15:23:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:23:15,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:15,991 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:16,004 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-01-09 15:23:16,191 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-01-09 15:23:16,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:16,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 312441807, now seen corresponding path program 1 times [2025-01-09 15:23:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:23:16,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328654348] [2025-01-09 15:23:16,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:16,195 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-01-09 15:23:16,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:23:16,200 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-01-09 15:23:16,201 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-01-09 15:23:16,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:23:16,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:23:16,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:16,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:16,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:23:16,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2025-01-09 15:23:16,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:23:16,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:23:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328654348] [2025-01-09 15:23:16,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328654348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:16,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:16,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:23:16,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377437723] [2025-01-09 15:23:16,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:16,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:23:16,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:23:16,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:23:16,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:23:16,519 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:23:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:16,617 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2025-01-09 15:23:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:23:16,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:23:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:16,618 INFO L225 Difference]: With dead ends: 239 [2025-01-09 15:23:16,618 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:23:16,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:23:16,619 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:16,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:23:16,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:23:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 15:23:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:23:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-01-09 15:23:16,628 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 149 [2025-01-09 15:23:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:16,628 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-01-09 15:23:16,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:23:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-01-09 15:23:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:23:16,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:16,630 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:16,638 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 15:23:16,834 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-01-09 15:23:16,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:16,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash -549391795, now seen corresponding path program 1 times [2025-01-09 15:23:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:23:16,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592728027] [2025-01-09 15:23:16,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:16,835 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-01-09 15:23:16,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:23:16,839 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-01-09 15:23:16,840 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-01-09 15:23:16,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:23:17,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:23:17,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:17,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:17,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:23:17,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:17,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-01-09 15:23:17,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:23:17,339 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 43 treesize of output 13 [2025-01-09 15:23:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 120 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:23:17,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:23:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:23:17,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:23:17,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592728027] [2025-01-09 15:23:17,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592728027] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:23:17,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:23:17,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 15:23:17,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894697661] [2025-01-09 15:23:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:17,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:23:17,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:23:17,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:23:17,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:23:17,517 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:23:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:17,535 INFO L93 Difference]: Finished difference Result 241 states and 353 transitions. [2025-01-09 15:23:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:23:17,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-01-09 15:23:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:17,540 INFO L225 Difference]: With dead ends: 241 [2025-01-09 15:23:17,540 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:23:17,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:23:17,541 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:17,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:23:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 15:23:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:23:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2025-01-09 15:23:17,548 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 149 [2025-01-09 15:23:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:17,548 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2025-01-09 15:23:17,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:23:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2025-01-09 15:23:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:23:17,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:17,550 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:17,559 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 15:23:17,750 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-01-09 15:23:17,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:17,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2120347650, now seen corresponding path program 1 times [2025-01-09 15:23:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:23:17,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526715374] [2025-01-09 15:23:17,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:17,753 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-01-09 15:23:17,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:23:17,754 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-01-09 15:23:17,756 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-01-09 15:23:17,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:23:18,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:23:18,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:18,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:18,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:23:18,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:18,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2025-01-09 15:23:18,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:23:18,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 138 treesize of output 69 [2025-01-09 15:23:20,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:23:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 82 [2025-01-09 15:23:28,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:23:28,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 126 [2025-01-09 15:23:28,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:23:28,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 418 treesize of output 142 [2025-01-09 15:23:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 116 proven. 192 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 15:23:28,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:23:29,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:23:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526715374] [2025-01-09 15:23:29,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526715374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:23:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [598488222] [2025-01-09 15:23:29,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:29,123 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:23:29,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:23:29,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:23:29,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 15:23:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:23:30,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:23:30,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:30,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:30,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 15:23:30,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:30,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 15:23:37,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:23:37,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 71 [2025-01-09 15:23:41,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:23:41,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 74 [2025-01-09 15:23:43,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:23:43,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 111 [2025-01-09 15:23:50,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:23:50,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 307 treesize of output 155 [2025-01-09 15:23:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 60 proven. 192 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 15:23:50,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:23:50,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [598488222] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:23:50,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:23:50,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-01-09 15:23:50,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925486203] [2025-01-09 15:23:50,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:23:50,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 15:23:50,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:23:50,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 15:23:50,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=376, Unknown=9, NotChecked=0, Total=462 [2025-01-09 15:23:50,172 INFO L87 Difference]: Start difference. First operand 122 states and 177 transitions. Second operand has 19 states, 19 states have (on average 6.578947368421052) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2025-01-09 15:23:52,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:23:56,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:23:59,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:09,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:13,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:15,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:26,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:30,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:32,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:35,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:39,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:42,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:44,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:48,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]