./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.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/list-simple/dll2n_append_unequal.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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:23:45,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:23:45,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:23:45,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:23:45,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:23:45,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:23:45,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:23:45,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:23:45,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:23:45,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:23:45,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:23:45,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:23:45,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:23:45,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:23:45,255 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:23:45,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:23:45,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:23:45,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:23:45,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:23:45,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:23:45,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:23:45,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:23:45,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:23:45,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:23:45,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:23:45,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:23:45,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:23:45,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:23:45,257 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2025-03-03 13:23:45,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:23:45,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:23:45,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:23:45,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:23:45,497 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:23:45,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2025-03-03 13:23:46,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c430f5ec7/c702c5280d154928800e063aaa702204/FLAGaa3abddc0 [2025-03-03 13:23:46,859 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:23:46,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2025-03-03 13:23:46,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c430f5ec7/c702c5280d154928800e063aaa702204/FLAGaa3abddc0 [2025-03-03 13:23:47,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c430f5ec7/c702c5280d154928800e063aaa702204 [2025-03-03 13:23:47,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:23:47,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:23:47,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:23:47,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:23:47,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:23:47,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fbebf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47, skipping insertion in model container [2025-03-03 13:23:47,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:23:47,383 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/list-simple/dll2n_append_unequal.i[24457,24470] [2025-03-03 13:23:47,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:23:47,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:23:47,430 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/list-simple/dll2n_append_unequal.i[24457,24470] [2025-03-03 13:23:47,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:23:47,453 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:23:47,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47 WrapperNode [2025-03-03 13:23:47,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:23:47,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:23:47,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:23:47,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:23:47,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,483 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 132 [2025-03-03 13:23:47,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:23:47,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:23:47,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:23:47,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:23:47,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,507 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 6, 16]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 1, 8]. [2025-03-03 13:23:47,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:23:47,517 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:23:47,517 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:23:47,517 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:23:47,518 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (1/1) ... [2025-03-03 13:23:47,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:23:47,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:23:47,540 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-03 13:23:47,542 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-03 13:23:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-03 13:23:47,559 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:23:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:23:47,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:23:47,648 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:23:47,649 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:23:47,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L622: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-03 13:23:47,808 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-03 13:23:47,821 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-03 13:23:47,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:23:47,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:23:47,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:23:47,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:23:47 BoogieIcfgContainer [2025-03-03 13:23:47,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:23:47,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:23:47,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:23:47,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:23:47,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:23:47" (1/3) ... [2025-03-03 13:23:47,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0fbc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:23:47, skipping insertion in model container [2025-03-03 13:23:47,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:23:47" (2/3) ... [2025-03-03 13:23:47,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0fbc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:23:47, skipping insertion in model container [2025-03-03 13:23:47,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:23:47" (3/3) ... [2025-03-03 13:23:47,840 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2025-03-03 13:23:47,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:23:47,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_unequal.i that has 2 procedures, 35 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 13:23:47,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:23:47,906 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;@3b1ca7e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:23:47,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:23:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:23:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:23:47,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:23:47,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:23:47,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:23:47,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:23:47,921 INFO L85 PathProgramCache]: Analyzing trace with hash -614966231, now seen corresponding path program 1 times [2025-03-03 13:23:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:23:47,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264194468] [2025-03-03 13:23:47,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:47,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:23:48,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:23:48,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:23:48,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:48,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:23:48,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:23:48,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264194468] [2025-03-03 13:23:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264194468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:23:48,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:23:48,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:23:48,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388183159] [2025-03-03 13:23:48,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:23:48,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:23:48,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:23:48,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:23:48,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:23:48,218 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:23:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:23:48,239 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2025-03-03 13:23:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:23:48,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-03 13:23:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:23:48,245 INFO L225 Difference]: With dead ends: 68 [2025-03-03 13:23:48,245 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 13:23:48,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:23:48,251 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:23:48,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:23:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 13:23:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2025-03-03 13:23:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:23:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-03 13:23:48,290 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2025-03-03 13:23:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:23:48,290 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-03 13:23:48,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:23:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-03 13:23:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:23:48,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:23:48,292 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:23:48,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:23:48,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:23:48,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:23:48,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1275227786, now seen corresponding path program 1 times [2025-03-03 13:23:48,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:23:48,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025545583] [2025-03-03 13:23:48,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:23:48,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:23:48,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:23:48,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:48,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:23:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:23:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025545583] [2025-03-03 13:23:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025545583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:23:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:23:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:23:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618352646] [2025-03-03 13:23:48,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:23:48,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:23:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:23:48,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:23:48,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:23:48,435 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:23:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:23:48,454 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2025-03-03 13:23:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:23:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-03 13:23:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:23:48,456 INFO L225 Difference]: With dead ends: 60 [2025-03-03 13:23:48,457 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 13:23:48,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:23:48,458 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:23:48,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:23:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 13:23:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 13:23:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:23:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-03-03 13:23:48,465 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 26 [2025-03-03 13:23:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:23:48,465 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-03-03 13:23:48,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:23:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2025-03-03 13:23:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:23:48,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:23:48,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:23:48,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:23:48,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:23:48,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:23:48,467 INFO L85 PathProgramCache]: Analyzing trace with hash 764693609, now seen corresponding path program 1 times [2025-03-03 13:23:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:23:48,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557311813] [2025-03-03 13:23:48,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:23:48,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:23:48,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:23:48,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:48,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:23:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:23:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557311813] [2025-03-03 13:23:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557311813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009841780] [2025-03-03 13:23:48,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:48,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:48,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:23:48,610 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-03 13:23:48,612 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-03 13:23:48,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:23:48,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:23:48,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:48,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:48,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:23:48,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:23:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:23:48,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:23:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:23:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009841780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:23:48,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:23:48,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-03 13:23:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234171740] [2025-03-03 13:23:48,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:23:48,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:23:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:23:48,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:23:48,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:23:48,813 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:23:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:23:48,837 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2025-03-03 13:23:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:23:48,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-03-03 13:23:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:23:48,838 INFO L225 Difference]: With dead ends: 57 [2025-03-03 13:23:48,838 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 13:23:48,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:23:48,838 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:23:48,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:23:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 13:23:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-03 13:23:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:23:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-03-03 13:23:48,843 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 26 [2025-03-03 13:23:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:23:48,843 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-03-03 13:23:48,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:23:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-03-03 13:23:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:23:48,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:23:48,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:23:48,851 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-03 13:23:49,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:49,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:23:49,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:23:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash -247525686, now seen corresponding path program 1 times [2025-03-03 13:23:49,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:23:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006446094] [2025-03-03 13:23:49,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:23:49,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:23:49,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:23:49,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:49,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 13:23:49,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:23:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006446094] [2025-03-03 13:23:49,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006446094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:23:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508731530] [2025-03-03 13:23:49,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:23:49,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:23:49,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:23:49,355 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-03 13:23:49,357 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-03 13:23:49,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:23:49,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:23:49,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:23:49,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:23:49,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-03 13:23:49,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:23:49,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:23:49,712 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:23:49,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-03 13:23:49,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-03 13:23:49,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-03 13:23:49,812 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2025-03-03 13:23:50,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 60 treesize of output 18 [2025-03-03 13:23:50,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2025-03-03 13:23:54,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:23:54,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2025-03-03 13:23:54,465 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-03-03 13:23:54,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-03-03 13:23:55,111 INFO L349 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2025-03-03 13:23:55,112 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 79 treesize of output 67 [2025-03-03 13:23:55,131 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 56 treesize of output 40 [2025-03-03 13:23:59,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:23:59,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 62 [2025-03-03 13:23:59,458 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 42 treesize of output 30 [2025-03-03 13:23:59,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 12 [2025-03-03 13:23:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:23:59,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:24:00,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508731530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:24:00,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:24:00,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23] total 31 [2025-03-03 13:24:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90110455] [2025-03-03 13:24:00,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:24:00,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 13:24:00,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:24:00,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 13:24:00,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1077, Unknown=5, NotChecked=0, Total=1190 [2025-03-03 13:24:00,679 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 25 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 13:24:04,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:24:14,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:24:19,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:24:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:24:19,082 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2025-03-03 13:24:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 13:24:19,085 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 25 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-03-03 13:24:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:24:19,087 INFO L225 Difference]: With dead ends: 68 [2025-03-03 13:24:19,087 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 13:24:19,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=143, Invalid=1333, Unknown=6, NotChecked=0, Total=1482 [2025-03-03 13:24:19,089 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2025-03-03 13:24:19,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 429 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 4 Unknown, 0 Unchecked, 13.9s Time] [2025-03-03 13:24:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 13:24:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-03-03 13:24:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:24:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-03 13:24:19,093 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 36 [2025-03-03 13:24:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:24:19,093 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-03 13:24:19,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 25 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 13:24:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-03 13:24:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:24:19,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:19,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:24:19,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:24:19,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 13:24:19,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:24:19,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:24:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash -703857981, now seen corresponding path program 1 times [2025-03-03 13:24:19,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:24:19,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945698452] [2025-03-03 13:24:19,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:19,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:24:19,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:24:19,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:24:19,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:19,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:24:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:24:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945698452] [2025-03-03 13:24:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945698452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:24:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785203330] [2025-03-03 13:24:21,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:21,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:21,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:21,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:24:21,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:24:21,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:24:21,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:24:21,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:21,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:21,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-03 13:24:21,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:24:21,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:24:22,488 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:24:22,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-03 13:24:22,668 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 11 treesize of output 7 [2025-03-03 13:24:22,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-03 13:24:22,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-03-03 13:24:23,416 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 42 treesize of output 18 [2025-03-03 13:24:23,427 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 15 treesize of output 7 [2025-03-03 13:24:23,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:24:23,904 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 50 treesize of output 33 [2025-03-03 13:24:23,968 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:24:23,969 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 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 13:24:25,253 INFO L349 Elim1Store]: treesize reduction 65, result has 14.5 percent of original size [2025-03-03 13:24:25,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 52 [2025-03-03 13:24:25,362 INFO L349 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2025-03-03 13:24:25,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 91 [2025-03-03 13:24:25,394 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 37 treesize of output 21 [2025-03-03 13:24:25,602 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 40 treesize of output 24 [2025-03-03 13:24:25,609 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 24 treesize of output 12 [2025-03-03 13:24:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:24:25,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:24:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785203330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:24:31,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:24:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 40 [2025-03-03 13:24:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127085179] [2025-03-03 13:24:31,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:24:31,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 13:24:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:24:31,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 13:24:31,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2001, Unknown=3, NotChecked=0, Total=2162 [2025-03-03 13:24:31,416 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 40 states, 38 states have (on average 1.394736842105263) internal successors, (53), 33 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 13:24:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:24:35,497 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-03 13:24:35,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 13:24:35,497 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.394736842105263) internal successors, (53), 33 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2025-03-03 13:24:35,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:24:35,498 INFO L225 Difference]: With dead ends: 56 [2025-03-03 13:24:35,498 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 13:24:35,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=273, Invalid=3146, Unknown=3, NotChecked=0, Total=3422 [2025-03-03 13:24:35,499 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 13:24:35,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 525 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 13:24:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 13:24:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2025-03-03 13:24:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:24:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-03-03 13:24:35,508 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2025-03-03 13:24:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:24:35,508 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-03-03 13:24:35,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.394736842105263) internal successors, (53), 33 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 13:24:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-03-03 13:24:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 13:24:35,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:35,509 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:24:35,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:24:35,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:35,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:24:35,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:24:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash -65693852, now seen corresponding path program 1 times [2025-03-03 13:24:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:24:35,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882594552] [2025-03-03 13:24:35,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:24:35,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 13:24:35,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 13:24:35,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:35,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:24:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:24:38,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882594552] [2025-03-03 13:24:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882594552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:24:38,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315727629] [2025-03-03 13:24:38,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:38,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:38,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:38,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:24:38,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:24:38,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 13:24:39,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 13:24:39,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:39,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:39,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-03 13:24:39,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:24:39,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:24:39,471 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:24:39,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-03 13:24:39,629 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 13 treesize of output 9 [2025-03-03 13:24:39,835 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-03 13:24:39,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2025-03-03 13:24:40,498 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 60 treesize of output 18 [2025-03-03 13:24:40,504 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 15 treesize of output 7 [2025-03-03 13:24:40,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:24:40,641 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 68 treesize of output 51 [2025-03-03 13:24:40,716 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-03-03 13:24:40,717 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 2 case distinctions, treesize of input 34 treesize of output 36 [2025-03-03 13:24:41,869 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2025-03-03 13:24:41,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 54 [2025-03-03 13:24:41,961 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-03 13:24:41,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 93 [2025-03-03 13:24:41,970 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 35 treesize of output 27 [2025-03-03 13:24:42,224 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 58 treesize of output 42 [2025-03-03 13:24:42,232 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 42 treesize of output 30 [2025-03-03 13:24:42,247 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 30 treesize of output 12 [2025-03-03 13:24:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:24:42,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:24:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315727629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:24:43,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:24:43,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 39 [2025-03-03 13:24:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806115329] [2025-03-03 13:24:43,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:24:43,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 13:24:43,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:24:43,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 13:24:43,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1837, Unknown=2, NotChecked=0, Total=1980 [2025-03-03 13:24:43,916 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 39 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 32 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 13:24:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:24:49,243 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-03-03 13:24:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 13:24:49,244 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 32 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2025-03-03 13:24:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:24:49,244 INFO L225 Difference]: With dead ends: 51 [2025-03-03 13:24:49,244 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 13:24:49,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=365, Invalid=4055, Unknown=2, NotChecked=0, Total=4422 [2025-03-03 13:24:49,245 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 53 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 13:24:49,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 387 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 13:24:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 13:24:49,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-03-03 13:24:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:24:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-03 13:24:49,250 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 41 [2025-03-03 13:24:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:24:49,251 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-03 13:24:49,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 32 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 13:24:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-03 13:24:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 13:24:49,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:49,251 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:24:49,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:24:49,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:49,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:24:49,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:24:49,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1292354135, now seen corresponding path program 1 times [2025-03-03 13:24:49,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:24:49,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728092541] [2025-03-03 13:24:49,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:24:49,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 13:24:49,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:24:49,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:49,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:24:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:24:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728092541] [2025-03-03 13:24:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728092541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:24:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027013124] [2025-03-03 13:24:53,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:53,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:53,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:53,126 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:24:53,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:24:53,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 13:24:53,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:24:53,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:53,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:53,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-03 13:24:53,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:24:53,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:24:54,632 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:24:54,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-03 13:24:54,881 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 7 [2025-03-03 13:24:54,900 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 13 treesize of output 9 [2025-03-03 13:24:55,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-03 13:24:55,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-03 13:24:55,157 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 28 treesize of output 11 [2025-03-03 13:24:56,065 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 42 treesize of output 14 [2025-03-03 13:24:56,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 3 [2025-03-03 13:24:56,082 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 15 treesize of output 7 [2025-03-03 13:24:56,609 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-03 13:24:56,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2025-03-03 13:24:56,622 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 9 treesize of output 3 [2025-03-03 13:24:56,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:24:56,647 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 50 treesize of output 39 [2025-03-03 13:24:56,722 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-03-03 13:24:56,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-03-03 13:24:57,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 58 treesize of output 16 [2025-03-03 13:24:57,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2025-03-03 13:24:57,928 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 23 treesize of output 15 [2025-03-03 13:24:57,932 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 11 [2025-03-03 13:24:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:24:58,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:24:58,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_938) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2025-03-03 13:25:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027013124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:07,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:25:07,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2025-03-03 13:25:07,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146570440] [2025-03-03 13:25:07,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:25:07,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-03 13:25:07,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:25:07,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-03 13:25:07,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2864, Unknown=56, NotChecked=108, Total=3192 [2025-03-03 13:25:07,807 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 52 states, 50 states have (on average 1.44) internal successors, (72), 43 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:25:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:25:14,268 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2025-03-03 13:25:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:25:14,269 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.44) internal successors, (72), 43 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2025-03-03 13:25:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:25:14,270 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:25:14,270 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 13:25:14,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=351, Invalid=5295, Unknown=58, NotChecked=148, Total=5852 [2025-03-03 13:25:14,271 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 13:25:14,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 510 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 13:25:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 13:25:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2025-03-03 13:25:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:25:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-03-03 13:25:14,277 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 43 [2025-03-03 13:25:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:25:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-03 13:25:14,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.44) internal successors, (72), 43 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:25:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-03-03 13:25:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 13:25:14,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:14,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:25:14,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:25:14,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:14,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:14,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:14,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1408240223, now seen corresponding path program 1 times [2025-03-03 13:25:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:14,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353251481] [2025-03-03 13:25:14,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:14,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:14,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 13:25:14,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:25:14,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:14,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:25:14,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:14,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353251481] [2025-03-03 13:25:14,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353251481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:25:14,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:25:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:25:14,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89730822] [2025-03-03 13:25:14,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:25:14,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:25:14,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:25:14,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:25:14,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:25:14,688 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:25:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:25:14,892 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2025-03-03 13:25:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:25:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-03 13:25:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:25:14,893 INFO L225 Difference]: With dead ends: 60 [2025-03-03 13:25:14,893 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 13:25:14,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:25:14,894 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:25:14,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 104 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:25:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 13:25:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2025-03-03 13:25:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:25:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-03-03 13:25:14,898 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 44 [2025-03-03 13:25:14,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:25:14,902 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-03-03 13:25:14,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:25:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-03-03 13:25:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:25:14,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:14,903 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:25:14,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 13:25:14,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:14,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:14,904 INFO L85 PathProgramCache]: Analyzing trace with hash -440392072, now seen corresponding path program 2 times [2025-03-03 13:25:14,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:14,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895762502] [2025-03-03 13:25:14,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:25:14,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:14,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-03 13:25:14,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:25:14,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:25:14,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:25:19,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895762502] [2025-03-03 13:25:19,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895762502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98807126] [2025-03-03 13:25:19,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:25:19,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:19,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:25:19,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:25:19,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:25:19,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-03 13:25:19,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:25:19,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:25:19,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:19,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-03-03 13:25:19,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:25:19,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:25:20,308 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 11 treesize of output 7 [2025-03-03 13:25:21,392 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:25:21,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-03 13:25:21,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:25:21,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2025-03-03 13:25:21,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:25:21,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-03 13:25:21,860 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 11 treesize of output 7 [2025-03-03 13:25:22,204 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:25:22,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 49 [2025-03-03 13:25:22,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:25:22,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-03 13:25:22,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:25:22,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-03 13:25:23,861 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-03 13:25:23,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 27 [2025-03-03 13:25:23,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-03 13:25:23,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-03 13:25:23,902 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 15 treesize of output 7 [2025-03-03 13:25:24,928 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-03 13:25:24,929 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-03 13:25:25,013 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-03 13:25:25,013 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-03 13:25:25,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:25:25,089 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-03 13:25:25,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 41 [2025-03-03 13:25:25,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:25:25,171 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:25:25,172 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 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 13:25:26,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3