./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.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-sp_file-9.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 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:16:46,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:16:46,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:16:46,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:16:46,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:16:46,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:16:46,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:16:46,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:16:46,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:16:46,831 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:16:46,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:16:46,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:16:46,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:16:46,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:16:46,832 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:16:46,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:16:46,833 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:16:46,833 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:16:46,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:16:46,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:16:46,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:16:46,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:16:46,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:16:46,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:16:46,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:16:46,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:16:46,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:16:46,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:16:46,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:16:46,835 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:16:46,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:16:46,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:16:46,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:16:46,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:16:46,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:16:46,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:16:46,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:16:46,836 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 -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2025-01-09 16:16:47,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:16:47,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:16:47,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:16:47,070 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:16:47,071 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:16:47,072 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-sp_file-9.i [2025-01-09 16:16:48,187 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5db56718b/566575c4c63b45bca6d49639f8cb334e/FLAG879967ee4 [2025-01-09 16:16:48,449 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:16:48,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-01-09 16:16:48,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5db56718b/566575c4c63b45bca6d49639f8cb334e/FLAG879967ee4 [2025-01-09 16:16:48,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5db56718b/566575c4c63b45bca6d49639f8cb334e [2025-01-09 16:16:48,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:16:48,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:16:48,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:16:48,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:16:48,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:16:48,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65eec39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48, skipping insertion in model container [2025-01-09 16:16:48,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:16:48,604 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-sp_file-9.i[916,929] [2025-01-09 16:16:48,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:16:48,659 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:16:48,667 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-sp_file-9.i[916,929] [2025-01-09 16:16:48,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:16:48,694 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:16:48,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48 WrapperNode [2025-01-09 16:16:48,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:16:48,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:16:48,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:16:48,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:16:48,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,727 INFO L138 Inliner]: procedures = 29, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 348 [2025-01-09 16:16:48,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:16:48,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:16:48,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:16:48,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:16:48,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,756 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-01-09 16:16:48,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,763 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:16:48,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:16:48,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:16:48,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:16:48,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (1/1) ... [2025-01-09 16:16:48,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:16:48,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:16:48,806 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 16:16:48,808 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 16:16:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:16:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 16:16:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 16:16:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:16:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:16:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 16:16:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 16:16:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:16:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:16:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 16:16:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 16:16:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:16:48,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:16:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:16:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:16:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:16:48,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:16:48,900 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:16:48,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:16:49,179 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-01-09 16:16:49,179 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:16:49,187 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:16:49,188 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:16:49,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:16:49 BoogieIcfgContainer [2025-01-09 16:16:49,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:16:49,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:16:49,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:16:49,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:16:49,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:16:48" (1/3) ... [2025-01-09 16:16:49,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798cc182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:16:49, skipping insertion in model container [2025-01-09 16:16:49,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48" (2/3) ... [2025-01-09 16:16:49,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798cc182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:16:49, skipping insertion in model container [2025-01-09 16:16:49,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:16:49" (3/3) ... [2025-01-09 16:16:49,196 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2025-01-09 16:16:49,205 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:16:49,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-9.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:16:49,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:16:49,251 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;@384a8e0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:16:49,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:16:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:16:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 16:16:49,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:49,262 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:49,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:49,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash 74147614, now seen corresponding path program 1 times [2025-01-09 16:16:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847511089] [2025-01-09 16:16:49,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:49,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:16:49,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:16:49,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:49,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 16:16:49,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:16:49,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847511089] [2025-01-09 16:16:49,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847511089] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:16:49,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059166140] [2025-01-09 16:16:49,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:49,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:16:49,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:16:49,489 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 16:16:49,490 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 16:16:49,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:16:49,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:16:49,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:49,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:49,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:16:49,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:16:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 16:16:49,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:16:49,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059166140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:16:49,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:16:49,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:16:49,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596416405] [2025-01-09 16:16:49,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:16:49,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:16:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:16:49,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:16:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:16:49,680 INFO L87 Difference]: Start difference. First operand has 75 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 16:16:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:16:49,697 INFO L93 Difference]: Finished difference Result 144 states and 210 transitions. [2025-01-09 16:16:49,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:16:49,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-01-09 16:16:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:16:49,703 INFO L225 Difference]: With dead ends: 144 [2025-01-09 16:16:49,703 INFO L226 Difference]: Without dead ends: 72 [2025-01-09 16:16:49,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 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 16:16:49,706 INFO L435 NwaCegarLoop]: 100 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, 100 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 16:16:49,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:16:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-09 16:16:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-01-09 16:16:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:16:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2025-01-09 16:16:49,733 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 62 [2025-01-09 16:16:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:16:49,733 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-01-09 16:16:49,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 16:16:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2025-01-09 16:16:49,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 16:16:49,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:49,736 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:49,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:16:49,937 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 16:16:49,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:49,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:49,938 INFO L85 PathProgramCache]: Analyzing trace with hash 698079460, now seen corresponding path program 1 times [2025-01-09 16:16:49,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:49,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735038484] [2025-01-09 16:16:49,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:49,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:16:50,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:16:50,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:50,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:16:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:16:50,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735038484] [2025-01-09 16:16:50,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735038484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:16:50,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:16:50,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:16:50,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431006642] [2025-01-09 16:16:50,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:16:50,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:16:50,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:16:50,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:16:50,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:16:50,172 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:16:50,209 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2025-01-09 16:16:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:16:50,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-01-09 16:16:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:16:50,210 INFO L225 Difference]: With dead ends: 144 [2025-01-09 16:16:50,210 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 16:16:50,210 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 16:16:50,211 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:16:50,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:16:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 16:16:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-01-09 16:16:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:16:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2025-01-09 16:16:50,218 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 62 [2025-01-09 16:16:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:16:50,219 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2025-01-09 16:16:50,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2025-01-09 16:16:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 16:16:50,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:50,221 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:50,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:16:50,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:50,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:50,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1399144038, now seen corresponding path program 1 times [2025-01-09 16:16:50,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:50,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349706363] [2025-01-09 16:16:50,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:50,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:50,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:16:50,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:16:50,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:50,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 16:16:50,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:16:50,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349706363] [2025-01-09 16:16:50,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349706363] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:16:50,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818032505] [2025-01-09 16:16:50,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:50,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:16:50,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:16:50,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:16:50,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:16:50,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:16:50,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:16:50,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:50,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:50,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:16:50,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:16:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:16:50,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:16:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818032505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:16:50,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:16:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-01-09 16:16:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813957628] [2025-01-09 16:16:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:16:50,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:16:50,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:16:50,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:16:50,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:16:50,945 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:16:50,972 INFO L93 Difference]: Finished difference Result 148 states and 205 transitions. [2025-01-09 16:16:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:16:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-01-09 16:16:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:16:50,974 INFO L225 Difference]: With dead ends: 148 [2025-01-09 16:16:50,974 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 16:16:50,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:16:50,975 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:16:50,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:16:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 16:16:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-01-09 16:16:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:16:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2025-01-09 16:16:50,979 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 62 [2025-01-09 16:16:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:16:50,979 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2025-01-09 16:16:50,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2025-01-09 16:16:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 16:16:50,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:50,980 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:50,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:16:51,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:16:51,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:51,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2079202408, now seen corresponding path program 1 times [2025-01-09 16:16:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320974207] [2025-01-09 16:16:51,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:51,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:16:51,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:16:51,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:51,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 16:16:51,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:16:51,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320974207] [2025-01-09 16:16:51,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320974207] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:16:51,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230567583] [2025-01-09 16:16:51,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:51,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:16:51,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:16:51,555 INFO L229 MonitoredProcess]: Starting monitored process 4 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 16:16:51,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:16:51,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:16:51,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:16:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:51,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:16:51,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:16:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:16:51,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:16:51,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230567583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:16:51,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:16:51,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-01-09 16:16:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914226577] [2025-01-09 16:16:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:16:51,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:16:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:16:51,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:16:51,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:16:51,719 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:16:51,739 INFO L93 Difference]: Finished difference Result 152 states and 209 transitions. [2025-01-09 16:16:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:16:51,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-01-09 16:16:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:16:51,741 INFO L225 Difference]: With dead ends: 152 [2025-01-09 16:16:51,742 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 16:16:51,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:16:51,743 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:16:51,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:16:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 16:16:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-01-09 16:16:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:16:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2025-01-09 16:16:51,747 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 62 [2025-01-09 16:16:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:16:51,748 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2025-01-09 16:16:51,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2025-01-09 16:16:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 16:16:51,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:51,749 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:51,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:16:51,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:16:51,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:51,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2081049450, now seen corresponding path program 1 times [2025-01-09 16:16:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:51,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499416912] [2025-01-09 16:16:51,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:51,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:16:51,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:16:51,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:51,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 16:16:52,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:16:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499416912] [2025-01-09 16:16:52,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499416912] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:16:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707611096] [2025-01-09 16:16:52,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:52,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:16:52,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:16:52,271 INFO L229 MonitoredProcess]: Starting monitored process 5 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 16:16:52,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:16:52,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:16:52,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:16:52,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:52,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:52,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 16:16:52,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:16:52,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2025-01-09 16:16:52,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:16:52,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 16 [2025-01-09 16:16:52,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:16:52,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-01-09 16:16:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:16:52,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:16:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707611096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:16:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:16:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-01-09 16:16:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354152122] [2025-01-09 16:16:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:16:52,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:16:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:16:52,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:16:52,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:16:52,960 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:16:53,230 INFO L93 Difference]: Finished difference Result 235 states and 321 transitions. [2025-01-09 16:16:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:16:53,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-01-09 16:16:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:16:53,231 INFO L225 Difference]: With dead ends: 235 [2025-01-09 16:16:53,231 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 16:16:53,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:16:53,232 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 111 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:16:53,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 328 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:16:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 16:16:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 103. [2025-01-09 16:16:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:16:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2025-01-09 16:16:53,254 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 62 [2025-01-09 16:16:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:16:53,255 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2025-01-09 16:16:53,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2025-01-09 16:16:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 16:16:53,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:53,256 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:53,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:16:53,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:16:53,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:53,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:53,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2069644160, now seen corresponding path program 1 times [2025-01-09 16:16:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678098527] [2025-01-09 16:16:53,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:53,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 16:16:53,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 16:16:53,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:53,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:16:53,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:16:53,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678098527] [2025-01-09 16:16:53,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678098527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:16:53,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:16:53,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:16:53,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188154234] [2025-01-09 16:16:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:16:53,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:16:53,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:16:53,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:16:53,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:16:53,842 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 16:16:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:16:54,213 INFO L93 Difference]: Finished difference Result 180 states and 245 transitions. [2025-01-09 16:16:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:16:54,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2025-01-09 16:16:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:16:54,215 INFO L225 Difference]: With dead ends: 180 [2025-01-09 16:16:54,215 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 16:16:54,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:16:54,217 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 208 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:16:54,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 220 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:16:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 16:16:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-01-09 16:16:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:16:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2025-01-09 16:16:54,247 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 63 [2025-01-09 16:16:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:16:54,248 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2025-01-09 16:16:54,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 16:16:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2025-01-09 16:16:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 16:16:54,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:54,248 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:54,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:16:54,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:54,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1083135412, now seen corresponding path program 1 times [2025-01-09 16:16:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:54,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121512731] [2025-01-09 16:16:54,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:54,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 16:16:54,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 16:16:54,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:16:54,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:16:54,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121512731] [2025-01-09 16:16:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121512731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:16:54,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:16:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:16:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975619483] [2025-01-09 16:16:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:16:54,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:16:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:16:54,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:16:54,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:16:54,936 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:16:55,480 INFO L93 Difference]: Finished difference Result 233 states and 315 transitions. [2025-01-09 16:16:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:16:55,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2025-01-09 16:16:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:16:55,481 INFO L225 Difference]: With dead ends: 233 [2025-01-09 16:16:55,481 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 16:16:55,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:16:55,482 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 131 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:16:55,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 295 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:16:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 16:16:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2025-01-09 16:16:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.345132743362832) internal successors, (152), 113 states have internal predecessors, (152), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:16:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2025-01-09 16:16:55,495 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 67 [2025-01-09 16:16:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:16:55,495 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2025-01-09 16:16:55,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2025-01-09 16:16:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 16:16:55,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:55,496 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:16:55,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash -113037688, now seen corresponding path program 1 times [2025-01-09 16:16:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401687215] [2025-01-09 16:16:55,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:55,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 16:16:55,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 16:16:55,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:55,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:16:55,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:16:55,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401687215] [2025-01-09 16:16:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401687215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:16:55,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:16:55,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:16:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710425578] [2025-01-09 16:16:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:16:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:16:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:16:55,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:16:55,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:16:55,701 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:16:55,955 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2025-01-09 16:16:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:16:55,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2025-01-09 16:16:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:16:55,958 INFO L225 Difference]: With dead ends: 262 [2025-01-09 16:16:55,958 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 16:16:55,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:16:55,958 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 147 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:16:55,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 254 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:16:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 16:16:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 130. [2025-01-09 16:16:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:16:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2025-01-09 16:16:56,002 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 67 [2025-01-09 16:16:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:16:56,002 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2025-01-09 16:16:56,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2025-01-09 16:16:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 16:16:56,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:56,003 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:56,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:16:56,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash -373907175, now seen corresponding path program 1 times [2025-01-09 16:16:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340196565] [2025-01-09 16:16:56,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:56,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 16:16:56,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 16:16:56,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:56,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:16:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:16:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:16:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340196565] [2025-01-09 16:16:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340196565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:16:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:16:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:16:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116688157] [2025-01-09 16:16:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:16:56,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:16:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:16:56,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:16:56,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:16:56,623 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:16:56,929 INFO L93 Difference]: Finished difference Result 290 states and 393 transitions. [2025-01-09 16:16:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:16:56,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2025-01-09 16:16:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:16:56,930 INFO L225 Difference]: With dead ends: 290 [2025-01-09 16:16:56,930 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 16:16:56,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:16:56,931 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 121 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:16:56,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 470 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:16:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 16:16:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 132. [2025-01-09 16:16:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.3361344537815125) internal successors, (159), 119 states have internal predecessors, (159), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:16:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 179 transitions. [2025-01-09 16:16:56,947 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 179 transitions. Word has length 68 [2025-01-09 16:16:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:16:56,947 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 179 transitions. [2025-01-09 16:16:56,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:16:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 179 transitions. [2025-01-09 16:16:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 16:16:56,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:16:56,948 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:56,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:16:56,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:16:56,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:16:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1615335765, now seen corresponding path program 1 times [2025-01-09 16:16:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:16:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948034638] [2025-01-09 16:16:56,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:16:56,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 16:16:57,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 16:16:57,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:57,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:16:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097313050] [2025-01-09 16:16:57,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:16:57,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:16:57,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:16:57,046 INFO L229 MonitoredProcess]: Starting monitored process 6 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 16:16:57,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:16:57,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 16:16:57,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 16:16:57,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:57,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:16:57,166 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:16:57,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 16:16:57,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 16:16:57,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:16:57,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:16:57,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:16:57,308 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:16:57,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:16:57,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:16:57,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:16:57,513 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:16:57,581 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:16:57,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:16:57 BoogieIcfgContainer [2025-01-09 16:16:57,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:16:57,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:16:57,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:16:57,583 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:16:57,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:16:49" (3/4) ... [2025-01-09 16:16:57,586 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:16:57,586 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:16:57,587 INFO L158 Benchmark]: Toolchain (without parser) took 9107.33ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 123.5MB in the beginning and 261.9MB in the end (delta: -138.4MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2025-01-09 16:16:57,587 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:16:57,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.12ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 109.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:16:57,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.22ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:16:57,588 INFO L158 Benchmark]: Boogie Preprocessor took 50.03ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 104.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:16:57,588 INFO L158 Benchmark]: RCFGBuilder took 407.32ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 77.5MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:16:57,588 INFO L158 Benchmark]: TraceAbstraction took 8392.50ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 76.5MB in the beginning and 261.9MB in the end (delta: -185.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:16:57,588 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 343.9MB. Free memory was 261.9MB in the beginning and 261.9MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:16:57,589 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.36ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.12ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 109.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.22ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.03ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 104.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 407.32ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 77.5MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8392.50ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 76.5MB in the beginning and 261.9MB in the end (delta: -185.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 343.9MB. Free memory was 261.9MB in the beginning and 261.9MB in the end (delta: 66.1kB). 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 shiftLeft at line 68, overapproximation of shiftLeft at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L45] unsigned char* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L47] unsigned char* WrapperStruct0_var_1_7_Pointer = &(WrapperStruct0.var_1_7); [L48] signed short int* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L49] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L50] double* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L51] double* WrapperStruct0_var_1_11_Pointer = &(WrapperStruct0.var_1_11); [L52] signed short int* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] signed long int* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L54] unsigned char last_1_WrapperStruct0_var_1_1 = 10; [L55] double last_1_WrapperStruct0_var_1_10 = 9.2; [L56] signed short int last_1_WrapperStruct0_var_1_12 = 1; [L57] signed long int last_1_WrapperStruct0_var_1_14 = -16; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=0, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L108] isInitial = 1 [L109] FCALL initially() [L111] CALL updateLastVariables() [L98] EXPR WrapperStruct0.var_1_1 [L98] last_1_WrapperStruct0_var_1_1 = WrapperStruct0.var_1_1 [L99] EXPR WrapperStruct0.var_1_10 [L99] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L100] EXPR WrapperStruct0.var_1_12 [L100] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L101] EXPR WrapperStruct0.var_1_14 [L101] last_1_WrapperStruct0_var_1_14 = WrapperStruct0.var_1_14 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L88] WrapperStruct0.var_1_3 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] CALL assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] RET assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L91] WrapperStruct0.var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L94] WrapperStruct0.var_1_11 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] CALL assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] RET assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L112] RET updateVariables() [L113] CALL step() [L61] unsigned char stepLocal_0 = last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10, stepLocal_0=0] [L62] COND FALSE !(((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || stepLocal_0) [L65] (*(WrapperStruct0_var_1_12_Pointer)) = last_1_WrapperStruct0_var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L67] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L67] (*(WrapperStruct0_var_1_14_Pointer)) = (*(WrapperStruct0_var_1_12_Pointer)) [L68] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L68] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] COND TRUE (10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer))) [L69] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L69] (*(WrapperStruct0_var_1_8_Pointer)) = ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))) [L71] (*(WrapperStruct0_var_1_9_Pointer)) = 64 [L72] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L72] (*(WrapperStruct0_var_1_10_Pointer)) = (*(WrapperStruct0_var_1_11_Pointer)) [L73] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L73] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) <= 16 [L74] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L74] (*(WrapperStruct0_var_1_1_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) [L104] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 [L104] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) [L104] EXPR \read(*WrapperStruct0_var_1_9_Pointer) [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) [L104] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104-L105] return (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 721 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 721 mSDsluCounter, 2510 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1767 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1090 IncrementalHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 743 mSDtfsCounter, 1090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=9, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 180 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 959 NumberOfCodeBlocks, 959 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 810 ConstructedInterpolants, 0 QuantifiedInterpolants, 4168 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1174 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 476/520 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 16:16:57,607 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-sp_file-9.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 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:16:59,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:16:59,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:16:59,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:16:59,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:16:59,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:16:59,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:16:59,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:16:59,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:16:59,741 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:16:59,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:16:59,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:16:59,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:16:59,742 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:16:59,743 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:16:59,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:16:59,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:16:59,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:16:59,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:16:59,745 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:16:59,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:16:59,746 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:16:59,746 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:16:59,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:16:59,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:16:59,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:16:59,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:16:59,746 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 -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2025-01-09 16:16:59,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:16:59,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:16:59,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:16:59,990 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:16:59,991 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:16:59,991 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-sp_file-9.i [2025-01-09 16:17:01,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d306c7e27/129392f3efde45228d6b180e676b03a9/FLAG6943bf91a [2025-01-09 16:17:01,343 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:17:01,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-01-09 16:17:01,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d306c7e27/129392f3efde45228d6b180e676b03a9/FLAG6943bf91a [2025-01-09 16:17:01,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d306c7e27/129392f3efde45228d6b180e676b03a9 [2025-01-09 16:17:01,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:17:01,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:17:01,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:17:01,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:17:01,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:17:01,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc5ce80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01, skipping insertion in model container [2025-01-09 16:17:01,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:17:01,501 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-sp_file-9.i[916,929] [2025-01-09 16:17:01,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:17:01,566 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:17:01,573 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-sp_file-9.i[916,929] [2025-01-09 16:17:01,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:17:01,627 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:17:01,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01 WrapperNode [2025-01-09 16:17:01,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:17:01,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:17:01,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:17:01,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:17:01,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,678 INFO L138 Inliner]: procedures = 36, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 334 [2025-01-09 16:17:01,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:17:01,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:17:01,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:17:01,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:17:01,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,715 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-01-09 16:17:01,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:17:01,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:17:01,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:17:01,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:17:01,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (1/1) ... [2025-01-09 16:17:01,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:01,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:17:01,778 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 16:17:01,781 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 16:17:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:17:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:17:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:17:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:17:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:17:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:17:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:17:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:17:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:17:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:17:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:17:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:17:01,884 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:17:01,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:17:02,277 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-01-09 16:17:02,277 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:17:02,287 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:17:02,288 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:17:02,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:02 BoogieIcfgContainer [2025-01-09 16:17:02,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:17:02,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:17:02,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:17:02,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:17:02,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:17:01" (1/3) ... [2025-01-09 16:17:02,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc71b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:02, skipping insertion in model container [2025-01-09 16:17:02,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:01" (2/3) ... [2025-01-09 16:17:02,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc71b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:02, skipping insertion in model container [2025-01-09 16:17:02,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:02" (3/3) ... [2025-01-09 16:17:02,298 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2025-01-09 16:17:02,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:17:02,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-9.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:17:02,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:17:02,380 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;@5eb8f836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:17:02,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:17:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:17:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 16:17:02,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:02,390 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:02,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash 227394995, now seen corresponding path program 1 times [2025-01-09 16:17:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:02,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468954978] [2025-01-09 16:17:02,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:02,403 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 16:17:02,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:02,405 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 16:17:02,407 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 16:17:02,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 16:17:02,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 16:17:02,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:02,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:02,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:17:02,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 16:17:02,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:02,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468954978] [2025-01-09 16:17:02,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468954978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:02,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:02,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:17:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72435499] [2025-01-09 16:17:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:02,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:17:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:17:02,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:17:02,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:17:02,655 INFO L87 Difference]: Start difference. First operand has 69 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:02,674 INFO L93 Difference]: Finished difference Result 132 states and 194 transitions. [2025-01-09 16:17:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:17:02,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-01-09 16:17:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:02,681 INFO L225 Difference]: With dead ends: 132 [2025-01-09 16:17:02,681 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 16:17:02,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 16:17:02,686 INFO L435 NwaCegarLoop]: 92 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, 92 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 16:17:02,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 16:17:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 16:17:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:17:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-01-09 16:17:02,717 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2025-01-09 16:17:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:02,717 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-01-09 16:17:02,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2025-01-09 16:17:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 16:17:02,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:02,722 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:02,729 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 16:17:02,922 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 16:17:02,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:02,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -40111879, now seen corresponding path program 1 times [2025-01-09 16:17:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539534166] [2025-01-09 16:17:02,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:02,928 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 16:17:02,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:02,930 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 16:17:02,932 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 16:17:03,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 16:17:03,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 16:17:03,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:03,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:03,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:17:03,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:17:03,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:03,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:03,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539534166] [2025-01-09 16:17:03,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539534166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:03,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:03,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:17:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979479402] [2025-01-09 16:17:03,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:03,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:17:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:17:03,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:17:03,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:03,140 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:03,174 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2025-01-09 16:17:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:17:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-01-09 16:17:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:03,177 INFO L225 Difference]: With dead ends: 132 [2025-01-09 16:17:03,177 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 16:17:03,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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 16:17:03,178 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:03,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 16:17:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-01-09 16:17:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:17:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-01-09 16:17:03,188 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2025-01-09 16:17:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:03,188 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-01-09 16:17:03,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-01-09 16:17:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 16:17:03,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:03,190 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:03,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 16:17:03,390 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 16:17:03,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:03,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash 660952699, now seen corresponding path program 1 times [2025-01-09 16:17:03,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:03,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666495936] [2025-01-09 16:17:03,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:03,395 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 16:17:03,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:03,397 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 16:17:03,398 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 16:17:03,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 16:17:03,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 16:17:03,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:03,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:03,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:17:03,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:17:03,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:03,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:03,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666495936] [2025-01-09 16:17:03,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666495936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:03,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:03,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:17:03,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702250261] [2025-01-09 16:17:03,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:03,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:17:03,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:17:03,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:17:03,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:03,618 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:03,664 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2025-01-09 16:17:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:17:03,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-01-09 16:17:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:03,666 INFO L225 Difference]: With dead ends: 136 [2025-01-09 16:17:03,666 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 16:17:03,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:03,667 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:03,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 16:17:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-01-09 16:17:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:17:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2025-01-09 16:17:03,673 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2025-01-09 16:17:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:03,673 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2025-01-09 16:17:03,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2025-01-09 16:17:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 16:17:03,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:03,676 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:03,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 16:17:03,877 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 16:17:03,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1341011069, now seen corresponding path program 1 times [2025-01-09 16:17:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:03,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756610759] [2025-01-09 16:17:03,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:03,878 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 16:17:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:03,882 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 16:17:03,884 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 16:17:03,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 16:17:04,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 16:17:04,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:04,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:04,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:17:04,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:17:04,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:04,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:04,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756610759] [2025-01-09 16:17:04,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756610759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:04,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:04,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:17:04,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241542584] [2025-01-09 16:17:04,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:04,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:17:04,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:17:04,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:17:04,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:17:04,056 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:04,113 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2025-01-09 16:17:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:17:04,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-01-09 16:17:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:04,115 INFO L225 Difference]: With dead ends: 142 [2025-01-09 16:17:04,115 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 16:17:04,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:17:04,115 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:04,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:04,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 16:17:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-01-09 16:17:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:17:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-01-09 16:17:04,119 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 60 [2025-01-09 16:17:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:04,122 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-01-09 16:17:04,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-01-09 16:17:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 16:17:04,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:04,124 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:04,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 16:17:04,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:17:04,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:04,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1342858111, now seen corresponding path program 1 times [2025-01-09 16:17:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:04,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822220180] [2025-01-09 16:17:04,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:04,327 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 16:17:04,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:04,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:17:04,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 16:17:04,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 16:17:04,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 16:17:04,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:04,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:04,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 16:17:04,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:05,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 16:17:06,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 16:17:07,049 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 0 case distinctions, treesize of input 33 treesize of output 39 [2025-01-09 16:17:10,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2025-01-09 16:17:10,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2025-01-09 16:17:10,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 77 [2025-01-09 16:17:10,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 45 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 88 [2025-01-09 16:17:10,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 100 [2025-01-09 16:17:10,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:17:10,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 124 treesize of output 64 [2025-01-09 16:17:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 16:17:10,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:17:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:17:10,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:10,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822220180] [2025-01-09 16:17:10,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822220180] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:17:10,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:17:10,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2025-01-09 16:17:10,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022058043] [2025-01-09 16:17:10,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:10,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:17:10,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:17:10,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:17:10,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=149, Unknown=1, NotChecked=0, Total=182 [2025-01-09 16:17:10,782 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:11,041 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2025-01-09 16:17:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:17:11,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-01-09 16:17:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:11,043 INFO L225 Difference]: With dead ends: 149 [2025-01-09 16:17:11,043 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 16:17:11,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=40, Invalid=199, Unknown=1, NotChecked=0, Total=240 [2025-01-09 16:17:11,045 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:11,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 235 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:17:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 16:17:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-01-09 16:17:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 16:17:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2025-01-09 16:17:11,049 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 60 [2025-01-09 16:17:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:11,049 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2025-01-09 16:17:11,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 16:17:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2025-01-09 16:17:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 16:17:11,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:11,050 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:11,057 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 (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:17:11,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 16:17:11,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:11,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:11,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1723892662, now seen corresponding path program 1 times [2025-01-09 16:17:11,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:11,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057789138] [2025-01-09 16:17:11,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:11,253 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 16:17:11,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:11,254 INFO L229 MonitoredProcess]: Starting monitored process 7 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 16:17:11,256 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 (7)] Waiting until timeout for monitored process [2025-01-09 16:17:11,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:17:11,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:17:11,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:11,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:11,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 16:17:11,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:13,049 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 22 treesize of output 1 [2025-01-09 16:17:14,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2025-01-09 16:17:14,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 71 [2025-01-09 16:17:14,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 87 [2025-01-09 16:17:14,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 127 [2025-01-09 16:17:14,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 133 [2025-01-09 16:17:15,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:17:15,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 337 treesize of output 145 [2025-01-09 16:17:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 16:17:15,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:17:24,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_147 (_ BitVec 32)) (v_ArrVal_142 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse11 (let ((.cse13 ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int#1| c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset))))) (let ((.cse12 (store |c_#memory_int#1| c_~WrapperStruct0_var_1_14_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct0_var_1_14_Pointer~0.base) c_~WrapperStruct0_var_1_14_Pointer~0.offset .cse13)))) (store .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base (store (select .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base) c_~WrapperStruct0_var_1_8_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse12 c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset))) .cse13))))))))) (store .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base (store (select .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base) c_~WrapperStruct0_var_1_9_Pointer~0.offset v_ArrVal_142))))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)))) (let ((.cse6 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_10_Pointer~0.offset))) (let ((.cse7 (let ((.cse10 (store .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base (store (store (select .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base) c_~WrapperStruct0_var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))))) (store .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base (store (select .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base) c_~WrapperStruct0_var_1_1_Pointer~0.offset v_ArrVal_147))))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~WrapperStruct0_var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~WrapperStruct0_var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2025-01-09 16:17:42,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_138 (_ BitVec 32)) (v_ArrVal_147 (_ BitVec 32)) (v_ArrVal_142 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse11 (let ((.cse13 ((_ sign_extend 16) ((_ extract 15 0) v_ArrVal_138)))) (let ((.cse12 (let ((.cse14 (store |c_#memory_int#1| c_~WrapperStruct0_var_1_12_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset v_ArrVal_138)))) (store .cse14 c_~WrapperStruct0_var_1_14_Pointer~0.base (store (select .cse14 c_~WrapperStruct0_var_1_14_Pointer~0.base) c_~WrapperStruct0_var_1_14_Pointer~0.offset .cse13))))) (store .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base (store (select .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base) c_~WrapperStruct0_var_1_8_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse12 c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset))) .cse13))))))))) (store .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base (store (select .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base) c_~WrapperStruct0_var_1_9_Pointer~0.offset v_ArrVal_142))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_10_Pointer~0.offset))) (let ((.cse7 (let ((.cse10 (store .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base (store (store (select .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base) c_~WrapperStruct0_var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))))) (store .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base (store (select .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base) c_~WrapperStruct0_var_1_1_Pointer~0.offset v_ArrVal_147))))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~WrapperStruct0_var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~WrapperStruct0_var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2025-01-09 16:17:43,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057789138] [2025-01-09 16:17:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057789138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:17:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [230660426] [2025-01-09 16:17:43,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:43,393 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 16:17:43,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 16:17:43,395 INFO L229 MonitoredProcess]: Starting monitored process 8 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 16:17:43,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-01-09 16:17:43,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 16:17:44,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 16:17:44,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:44,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:44,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 16:17:44,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:46,866 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 16:17:49,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-01-09 16:17:49,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 79 [2025-01-09 16:17:49,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 101 [2025-01-09 16:17:49,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 95 [2025-01-09 16:17:50,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 104 [2025-01-09 16:17:51,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 116 [2025-01-09 16:17:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 16:17:51,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:18:10,100 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_171 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_147 (_ BitVec 32)) (v_ArrVal_142 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse11 (let ((.cse13 ((_ sign_extend 16) ((_ extract 15 0) v_ArrVal_171)))) (let ((.cse12 (let ((.cse14 (store |c_#memory_int#1| c_~WrapperStruct0_var_1_12_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset v_ArrVal_171)))) (store .cse14 c_~WrapperStruct0_var_1_14_Pointer~0.base (store (select .cse14 c_~WrapperStruct0_var_1_14_Pointer~0.base) c_~WrapperStruct0_var_1_14_Pointer~0.offset .cse13))))) (store .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base (store (select .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base) c_~WrapperStruct0_var_1_8_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse12 c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset))) .cse13))))))))) (store .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base (store (select .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base) c_~WrapperStruct0_var_1_9_Pointer~0.offset v_ArrVal_142))))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)))) (let ((.cse6 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_10_Pointer~0.offset))) (let ((.cse7 (let ((.cse10 (store .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base (store (store (select .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base) c_~WrapperStruct0_var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))))) (store .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base (store (select .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base) c_~WrapperStruct0_var_1_1_Pointer~0.offset v_ArrVal_147))))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~WrapperStruct0_var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~WrapperStruct0_var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2025-01-09 16:18:10,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [230660426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:18:10,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:18:10,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-01-09 16:18:10,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626375821] [2025-01-09 16:18:10,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:18:10,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 16:18:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:18:10,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 16:18:10,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=560, Unknown=4, NotChecked=150, Total=812 [2025-01-09 16:18:10,798 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 21 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 16:18:24,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]