./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8e02e3162d4ac684b0ff9ed860eab65b0ec801c533748a64b9c6f0865c039d56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:50:48,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:50:48,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:50:48,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:50:48,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:50:48,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:50:48,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:50:48,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:50:48,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:50:48,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:50:48,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:50:48,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:50:48,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:50:48,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:50:48,249 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:50:48,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:50:48,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:50:48,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:50:48,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:50:48,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:50:48,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:50:48,252 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/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 -> 8e02e3162d4ac684b0ff9ed860eab65b0ec801c533748a64b9c6f0865c039d56 [2025-03-04 01:50:48,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:50:48,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:50:48,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:50:48,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:50:48,483 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:50:48,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-43.i [2025-03-04 01:50:49,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edc7b74a/ff15ccdafc71437ca9d0a173224a375a/FLAG416d9b7ba [2025-03-04 01:50:49,831 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:50:49,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-43.i [2025-03-04 01:50:49,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edc7b74a/ff15ccdafc71437ca9d0a173224a375a/FLAG416d9b7ba [2025-03-04 01:50:50,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edc7b74a/ff15ccdafc71437ca9d0a173224a375a [2025-03-04 01:50:50,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:50:50,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:50:50,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:50:50,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:50:50,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:50:50,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526be6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50, skipping insertion in model container [2025-03-04 01:50:50,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:50:50,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-43.i[917,930] [2025-03-04 01:50:50,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:50:50,316 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:50:50,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-43.i[917,930] [2025-03-04 01:50:50,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:50:50,378 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:50:50,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50 WrapperNode [2025-03-04 01:50:50,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:50:50,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:50:50,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:50:50,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:50:50,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,427 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 556 [2025-03-04 01:50:50,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:50:50,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:50:50,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:50:50,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:50:50,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,442 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:50:50,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:50:50,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:50:50,471 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:50:50,471 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:50:50,472 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (1/1) ... [2025-03-04 01:50:50,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:50:50,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:50:50,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:50:50,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:50:50,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:50:50,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:50:50,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:50:50,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:50:50,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:50:50,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:50:50,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:50:50,519 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:50:50,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:50:50,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:50:50,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:50:50,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:50:50,618 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:50:50,619 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:50:51,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L149: havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite115#1;havoc property_#t~mem102#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem109#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~bitwise118#1;havoc property_#t~ite127#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short128#1;havoc property_#t~mem132#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~bitwise131#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~short147#1; [2025-03-04 01:50:51,176 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-03-04 01:50:51,176 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:50:51,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:50:51,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:50:51,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:50:51 BoogieIcfgContainer [2025-03-04 01:50:51,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:50:51,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:50:51,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:50:51,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:50:51,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:50:50" (1/3) ... [2025-03-04 01:50:51,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8a276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:50:51, skipping insertion in model container [2025-03-04 01:50:51,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:50" (2/3) ... [2025-03-04 01:50:51,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8a276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:50:51, skipping insertion in model container [2025-03-04 01:50:51,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:50:51" (3/3) ... [2025-03-04 01:50:51,199 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-43.i [2025-03-04 01:50:51,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:50:51,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-43.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:50:51,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:50:51,273 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;@7d06e71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:50:51,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:50:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:50:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:50:51,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:51,286 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:50:51,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash 221439428, now seen corresponding path program 1 times [2025-03-04 01:50:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:51,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004024617] [2025-03-04 01:50:51,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:51,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:50:51,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:50:51,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:51,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 01:50:51,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:51,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004024617] [2025-03-04 01:50:51,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004024617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:50:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206527538] [2025-03-04 01:50:51,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:51,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:50:51,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:50:51,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:50:51,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:50:51,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:50:51,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:50:51,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:51,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:51,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:50:51,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:50:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 01:50:51,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:50:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206527538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:50:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:50:52,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158726560] [2025-03-04 01:50:52,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:52,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:50:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:52,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:50:52,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:50:52,022 INFO L87 Difference]: Start difference. First operand has 125 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:50:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:52,045 INFO L93 Difference]: Finished difference Result 244 states and 385 transitions. [2025-03-04 01:50:52,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:50:52,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2025-03-04 01:50:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:52,051 INFO L225 Difference]: With dead ends: 244 [2025-03-04 01:50:52,053 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:50:52,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-03-04 01:50:52,058 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:52,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:50:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:50:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 01:50:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:50:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-03-04 01:50:52,092 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 168 [2025-03-04 01:50:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:52,092 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-03-04 01:50:52,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:50:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-03-04 01:50:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:50:52,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:52,095 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:50:52,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:50:52,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:50:52,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:52,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:52,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1444377108, now seen corresponding path program 1 times [2025-03-04 01:50:52,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:52,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433984258] [2025-03-04 01:50:52,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:52,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:52,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:50:52,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:50:52,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:52,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:50:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433984258] [2025-03-04 01:50:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433984258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:52,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:52,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:50:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196438470] [2025-03-04 01:50:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:52,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:50:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:52,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:50:52,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:50:52,707 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:50:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:52,752 INFO L93 Difference]: Finished difference Result 244 states and 361 transitions. [2025-03-04 01:50:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:50:52,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2025-03-04 01:50:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:52,757 INFO L225 Difference]: With dead ends: 244 [2025-03-04 01:50:52,757 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:50:52,758 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-03-04 01:50:52,758 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:52,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 508 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:50:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:50:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-04 01:50:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:50:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2025-03-04 01:50:52,775 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 168 [2025-03-04 01:50:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:52,777 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2025-03-04 01:50:52,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:50:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2025-03-04 01:50:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:50:52,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:52,780 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:50:52,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:50:52,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash -363077355, now seen corresponding path program 1 times [2025-03-04 01:50:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405352119] [2025-03-04 01:50:52,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:52,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:50:52,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:50:52,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:52,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:50:52,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:52,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405352119] [2025-03-04 01:50:52,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405352119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:52,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:52,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:50:52,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211476710] [2025-03-04 01:50:52,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:52,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:50:52,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:52,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:50:52,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:50:52,988 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:50:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:53,025 INFO L93 Difference]: Finished difference Result 248 states and 365 transitions. [2025-03-04 01:50:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:50:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2025-03-04 01:50:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:53,027 INFO L225 Difference]: With dead ends: 248 [2025-03-04 01:50:53,028 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 01:50:53,029 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-03-04 01:50:53,030 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:53,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 509 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:50:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 01:50:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-03-04 01:50:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:50:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2025-03-04 01:50:53,043 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 168 [2025-03-04 01:50:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:53,043 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2025-03-04 01:50:53,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:50:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2025-03-04 01:50:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:50:53,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:53,047 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:50:53,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:50:53,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:53,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash 524426326, now seen corresponding path program 1 times [2025-03-04 01:50:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:53,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126523103] [2025-03-04 01:50:53,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:53,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:50:53,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:50:53,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:53,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:50:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126523103] [2025-03-04 01:50:53,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126523103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:53,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:53,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:50:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839385413] [2025-03-04 01:50:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:53,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:50:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:53,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:50:53,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:50:53,277 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:50:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:53,310 INFO L93 Difference]: Finished difference Result 252 states and 369 transitions. [2025-03-04 01:50:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:50:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2025-03-04 01:50:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:53,313 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:50:53,314 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 01:50:53,315 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-03-04 01:50:53,315 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:53,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 511 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:50:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 01:50:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-03-04 01:50:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:50:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2025-03-04 01:50:53,325 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 168 [2025-03-04 01:50:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:53,326 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2025-03-04 01:50:53,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:50:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2025-03-04 01:50:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:50:53,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:53,328 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:50:53,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:50:53,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:53,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash 525349847, now seen corresponding path program 1 times [2025-03-04 01:50:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683912359] [2025-03-04 01:50:53,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:53,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:50:53,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:50:53,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:53,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:50:55,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683912359] [2025-03-04 01:50:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683912359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:50:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486272428] [2025-03-04 01:50:55,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:55,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:50:55,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:50:55,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:50:55,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:50:55,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:50:55,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:50:55,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:55,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:55,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 01:50:55,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:50:56,295 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-03-04 01:50:56,610 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 23 treesize of output 11 [2025-03-04 01:50:56,796 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 23 treesize of output 11 [2025-03-04 01:50:56,981 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 23 treesize of output 11 [2025-03-04 01:50:57,193 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 23 treesize of output 11 [2025-03-04 01:50:57,389 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 23 treesize of output 11 [2025-03-04 01:50:57,576 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 23 treesize of output 11 [2025-03-04 01:50:57,763 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 23 treesize of output 11 [2025-03-04 01:50:57,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:50:57,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:50:58,020 INFO L349 Elim1Store]: treesize reduction 245, result has 25.1 percent of original size [2025-03-04 01:50:58,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 145 [2025-03-04 01:51:00,087 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2025-03-04 01:51:00,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 182 [2025-03-04 01:51:00,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,484 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 01:51:00,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2025-03-04 01:51:00,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-04 01:51:00,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-04 01:51:00,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,527 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 01:51:00,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2025-03-04 01:51:00,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,587 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2025-03-04 01:51:00,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 36 [2025-03-04 01:51:00,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-04 01:51:00,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-04 01:51:00,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:51:00,684 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 01:51:00,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29