./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_prepend_equal.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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:42:24,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:42:24,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:42:24,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:42:24,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:42:24,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:42:24,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:42:24,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:42:24,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:42:24,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:42:24,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:42:24,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:42:24,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:42:24,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:42:24,344 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:42:24,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:42:24,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:42:24,345 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:42:24,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:42:24,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:42:24,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:42:24,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:42:24,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:42:24,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:42:24,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:42:24,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:42:24,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:42:24,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:42:24,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:42:24,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:42:24,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:42:24,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:42:24,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:42:24,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:42:24,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:42:24,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:42:24,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:42:24,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:42:24,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:42:24,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:42:24,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:42:24,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:42:24,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:42:24,347 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2025-03-16 17:42:24,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:42:24,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:42:24,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:42:24,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:42:24,577 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:42:24,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2025-03-16 17:42:25,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca6fb8e0/ec423ae4c0cc4906bf8026149880477b/FLAG4e47e61ed [2025-03-16 17:42:25,940 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:42:25,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2025-03-16 17:42:25,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca6fb8e0/ec423ae4c0cc4906bf8026149880477b/FLAG4e47e61ed [2025-03-16 17:42:25,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca6fb8e0/ec423ae4c0cc4906bf8026149880477b [2025-03-16 17:42:25,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:42:25,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:42:25,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:42:25,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:42:25,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:42:25,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:42:25" (1/1) ... [2025-03-16 17:42:25,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f06443e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:25, skipping insertion in model container [2025-03-16 17:42:25,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:42:25" (1/1) ... [2025-03-16 17:42:25,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:42:26,199 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_prepend_equal.i[24361,24374] [2025-03-16 17:42:26,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:42:26,210 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:42:26,241 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_prepend_equal.i[24361,24374] [2025-03-16 17:42:26,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:42:26,262 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:42:26,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26 WrapperNode [2025-03-16 17:42:26,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:42:26,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:42:26,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:42:26,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:42:26,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,290 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 107 [2025-03-16 17:42:26,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:42:26,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:42:26,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:42:26,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:42:26,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,316 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 12, 7]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2025-03-16 17:42:26,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:42:26,328 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:42:26,328 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:42:26,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:42:26,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (1/1) ... [2025-03-16 17:42:26,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:42:26,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:26,349 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-16 17:42:26,351 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-16 17:42:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-16 17:42:26,365 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-16 17:42:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:42:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:42:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:42:26,469 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:42:26,470 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:42:26,498 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-16 17:42:26,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: 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-16 17:42:26,628 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-16 17:42:26,630 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:42:26,635 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:42:26,635 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:42:26,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:42:26 BoogieIcfgContainer [2025-03-16 17:42:26,636 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:42:26,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:42:26,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:42:26,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:42:26,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:42:25" (1/3) ... [2025-03-16 17:42:26,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b033b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:42:26, skipping insertion in model container [2025-03-16 17:42:26,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:42:26" (2/3) ... [2025-03-16 17:42:26,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b033b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:42:26, skipping insertion in model container [2025-03-16 17:42:26,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:42:26" (3/3) ... [2025-03-16 17:42:26,644 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2025-03-16 17:42:26,656 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:42:26,657 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_prepend_equal.i that has 2 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 17:42:26,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:42:26,709 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;@683e44bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:42:26,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:42:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:42:26,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:26,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:26,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:26,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 364416023, now seen corresponding path program 1 times [2025-03-16 17:42:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:26,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119023267] [2025-03-16 17:42:26,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:26,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:42:26,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:42:26,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:26,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:26,993 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-16 17:42:26,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119023267] [2025-03-16 17:42:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119023267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:42:26,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:42:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:42:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089991735] [2025-03-16 17:42:26,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:42:26,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:42:26,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:27,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:42:27,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:42:27,012 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:27,031 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2025-03-16 17:42:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:42:27,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 17:42:27,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:27,038 INFO L225 Difference]: With dead ends: 45 [2025-03-16 17:42:27,038 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 17:42:27,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 17:42:27,043 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:27,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:42:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 17:42:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2025-03-16 17:42:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-16 17:42:27,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2025-03-16 17:42:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:27,065 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-16 17:42:27,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-03-16 17:42:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 17:42:27,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:27,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:27,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:42:27,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:27,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1994333484, now seen corresponding path program 1 times [2025-03-16 17:42:27,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:27,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193086714] [2025-03-16 17:42:27,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:27,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:27,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:42:27,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:42:27,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:27,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:27,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:27,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193086714] [2025-03-16 17:42:27,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193086714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:42:27,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:42:27,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:42:27,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23185437] [2025-03-16 17:42:27,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:42:27,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:42:27,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:27,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:42:27,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:42:27,156 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:27,176 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2025-03-16 17:42:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:42:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 17:42:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:27,177 INFO L225 Difference]: With dead ends: 33 [2025-03-16 17:42:27,177 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 17:42:27,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 17:42:27,178 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:27,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:42:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 17:42:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-16 17:42:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-16 17:42:27,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14 [2025-03-16 17:42:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:27,181 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-16 17:42:27,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-16 17:42:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 17:42:27,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:27,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:27,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:42:27,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:27,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:27,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1797819979, now seen corresponding path program 1 times [2025-03-16 17:42:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:27,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105729899] [2025-03-16 17:42:27,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:27,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:27,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:42:27,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:42:27,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:27,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:27,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105729899] [2025-03-16 17:42:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105729899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7802703] [2025-03-16 17:42:27,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:27,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:27,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:27,317 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-16 17:42:27,318 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-16 17:42:27,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:42:27,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:42:27,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:27,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:27,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:42:27,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:27,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7802703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:42:27,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:42:27,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-16 17:42:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041347968] [2025-03-16 17:42:27,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:42:27,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:42:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:27,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:42:27,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:42:27,504 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:27,519 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2025-03-16 17:42:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:42:27,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 17:42:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:27,521 INFO L225 Difference]: With dead ends: 30 [2025-03-16 17:42:27,521 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 17:42:27,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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-16 17:42:27,522 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:27,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:42:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 17:42:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-16 17:42:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-16 17:42:27,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2025-03-16 17:42:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:27,525 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-16 17:42:27,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-16 17:42:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 17:42:27,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:27,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:27,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:42:27,730 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-16 17:42:27,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:27,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash -908305544, now seen corresponding path program 1 times [2025-03-16 17:42:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244879365] [2025-03-16 17:42:27,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:27,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:27,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 17:42:27,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:42:27,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:27,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:42:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244879365] [2025-03-16 17:42:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244879365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:42:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:42:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 17:42:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960646589] [2025-03-16 17:42:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:42:28,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 17:42:28,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:28,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 17:42:28,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:42:28,444 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:28,564 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-16 17:42:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 17:42:28,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 17:42:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:28,566 INFO L225 Difference]: With dead ends: 25 [2025-03-16 17:42:28,566 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 17:42:28,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:42:28,568 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:28,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 34 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:42:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 17:42:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-16 17:42:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-16 17:42:28,573 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 19 [2025-03-16 17:42:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:28,573 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-16 17:42:28,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-16 17:42:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 17:42:28,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:28,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:28,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:42:28,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:28,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:28,574 INFO L85 PathProgramCache]: Analyzing trace with hash -908304738, now seen corresponding path program 1 times [2025-03-16 17:42:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:28,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104199791] [2025-03-16 17:42:28,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:28,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 17:42:28,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:42:28,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:28,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:42:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:28,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104199791] [2025-03-16 17:42:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104199791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:42:28,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:42:28,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:42:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78794410] [2025-03-16 17:42:28,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:42:28,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:42:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:28,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:42:28,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:42:28,749 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:28,777 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-03-16 17:42:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:42:28,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 17:42:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:28,779 INFO L225 Difference]: With dead ends: 26 [2025-03-16 17:42:28,779 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 17:42:28,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:42:28,780 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:28,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:42:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 17:42:28,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-16 17:42:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-16 17:42:28,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2025-03-16 17:42:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:28,784 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-16 17:42:28,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-16 17:42:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 17:42:28,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:28,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:28,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:42:28,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:28,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1003193063, now seen corresponding path program 1 times [2025-03-16 17:42:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:28,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609562762] [2025-03-16 17:42:28,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:28,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:28,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 17:42:28,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 17:42:28,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:28,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609562762] [2025-03-16 17:42:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609562762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430810940] [2025-03-16 17:42:29,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:29,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:29,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:29,767 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-16 17:42:29,769 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-16 17:42:29,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 17:42:29,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 17:42:29,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:29,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:29,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-16 17:42:29,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:29,938 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-16 17:42:30,023 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:42:30,024 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-16 17:42:30,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-03-16 17:42:30,138 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 16 treesize of output 11 [2025-03-16 17:42:30,276 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-16 17:42:30,276 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 20 treesize of output 22 [2025-03-16 17:42:30,369 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 15 treesize of output 11 [2025-03-16 17:42:30,375 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 20 treesize of output 15 [2025-03-16 17:42:30,390 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 15 treesize of output 11 [2025-03-16 17:42:30,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:30,451 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 28 treesize of output 15 [2025-03-16 17:42:30,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:30,459 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 28 treesize of output 15 [2025-03-16 17:42:30,474 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:42:30,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:30,476 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 51 treesize of output 15 [2025-03-16 17:42:30,502 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 31 treesize of output 19 [2025-03-16 17:42:30,540 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 27 treesize of output 15 [2025-03-16 17:42:30,544 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 7 treesize of output 3 [2025-03-16 17:42:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:30,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:30,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:30,808 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 138 [2025-03-16 17:42:30,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:30,821 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 274 treesize of output 273 [2025-03-16 17:42:30,830 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 122 treesize of output 106 [2025-03-16 17:42:30,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:30,837 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 200 [2025-03-16 17:42:30,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:30,853 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 372 treesize of output 341 [2025-03-16 17:42:30,862 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 71 treesize of output 55 [2025-03-16 17:42:31,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse6 (select .cse17 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse21 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse5 (select .cse21 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse10 (+ .cse6 8))) (let ((.cse7 (forall ((v_ArrVal_512 (Array Int Int)) (v_arrayElimCell_19 Int) (v_ArrVal_518 Int) (v_arrayElimCell_16 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_512))) (store .cse22 .cse5 (store (select .cse22 .cse5) .cse10 v_ArrVal_518))) v_arrayElimCell_16) v_arrayElimCell_19)))) (.cse11 (= .cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse21 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (or .cse7 (not .cse11)))) (let ((.cse1 (and (forall ((v_ArrVal_512 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_518 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_512))) (let ((.cse19 (store (select .cse20 .cse5) .cse10 v_ArrVal_518))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 v_arrayElimCell_17)) (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 .cse5 .cse19) v_arrayElimCell_16) v_arrayElimCell_19))))))) (or .cse11 (forall ((v_ArrVal_512 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_518 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_512) .cse5) .cse10 v_ArrVal_518) v_arrayElimCell_17)))) .cse13)) (.cse2 (= .cse18 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse4 (= .cse18 .cse5)) (.cse0 (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse17 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse3 (and (or .cse11 (forall ((v_ArrVal_512 (Array Int Int)) (v_arrayElimCell_17 Int) (v_arrayElimCell_14 Int) (v_ArrVal_518 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_512))) (store .cse12 .cse5 (store (select .cse12 .cse5) .cse10 v_ArrVal_518))) v_arrayElimCell_14) v_arrayElimCell_17)))) (or .cse11 (forall ((v_ArrVal_512 (Array Int Int)) (v_arrayElimCell_14 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_512) v_arrayElimCell_14) .cse6)))) .cse13 (forall ((v_ArrVal_512 (Array Int Int)) (v_arrayElimCell_17 Int) (v_arrayElimCell_14 Int) (v_ArrVal_518 Int)) (let ((.cse14 (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_512))) (store .cse15 .cse5 (store (select .cse15 .cse5) .cse10 v_ArrVal_518))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_14) v_arrayElimCell_17)) (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_16) v_arrayElimCell_19)))))) (forall ((v_ArrVal_512 (Array Int Int)) (v_arrayElimCell_14 Int) (v_ArrVal_518 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_512))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_14) .cse6)) (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse16 .cse5 (store (select .cse16 .cse5) .cse10 v_ArrVal_518)) v_arrayElimCell_16) v_arrayElimCell_19))))))))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse2 .cse3) (or .cse4 (forall ((v_ArrVal_512 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_512) .cse5) .cse6)))) (or (not .cse4) .cse7) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_518 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_512))) (let ((.cse9 (select .cse8 .cse5))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse8 .cse5 (store .cse9 .cse10 v_ArrVal_518)) v_arrayElimCell_16) v_arrayElimCell_19))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse6)))))) (or .cse0 .cse3)))))))) is different from false [2025-03-16 17:42:31,452 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 134 treesize of output 98 [2025-03-16 17:42:31,457 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 102 treesize of output 82 [2025-03-16 17:42:31,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:31,487 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2025-03-16 17:42:31,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:31,791 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2025-03-16 17:42:31,795 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:42:31,796 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 22 [2025-03-16 17:42:31,803 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 5 treesize of output 3 [2025-03-16 17:42:31,809 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 52 treesize of output 48 [2025-03-16 17:42:31,812 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 24 treesize of output 22 [2025-03-16 17:42:31,815 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 46 treesize of output 42 [2025-03-16 17:42:31,881 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2025-03-16 17:42:31,881 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 4 case distinctions, treesize of input 267 treesize of output 241 [2025-03-16 17:42:31,892 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:42:31,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:31,899 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 285 treesize of output 279 [2025-03-16 17:42:31,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:31,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 265 treesize of output 261 [2025-03-16 17:42:31,926 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 246 treesize of output 242 [2025-03-16 17:42:32,088 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 5 treesize of output 3 [2025-03-16 17:42:32,189 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 17 treesize of output 13 [2025-03-16 17:42:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430810940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:42:32,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:42:32,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 39 [2025-03-16 17:42:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669097155] [2025-03-16 17:42:32,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:42:32,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-16 17:42:32,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:32,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-16 17:42:32,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1335, Unknown=15, NotChecked=74, Total=1560 [2025-03-16 17:42:32,500 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 40 states, 40 states have (on average 1.45) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:33,534 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-16 17:42:33,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 17:42:33,535 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.45) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 17:42:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:33,536 INFO L225 Difference]: With dead ends: 30 [2025-03-16 17:42:33,536 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 17:42:33,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=261, Invalid=1890, Unknown=15, NotChecked=90, Total=2256 [2025-03-16 17:42:33,537 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:33,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 475 Invalid, 1 Unknown, 29 Unchecked, 0.6s Time] [2025-03-16 17:42:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 17:42:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-16 17:42:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-16 17:42:33,540 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 21 [2025-03-16 17:42:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:33,540 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-16 17:42:33,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.45) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-16 17:42:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 17:42:33,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:33,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:33,547 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-16 17:42:33,744 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,SelfDestructingSolverStorable5 [2025-03-16 17:42:33,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:33,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1003192257, now seen corresponding path program 1 times [2025-03-16 17:42:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155331880] [2025-03-16 17:42:33,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:33,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 17:42:33,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 17:42:33,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:33,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:42:34,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155331880] [2025-03-16 17:42:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155331880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135572453] [2025-03-16 17:42:34,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:34,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:34,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:34,152 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-16 17:42:34,154 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-16 17:42:34,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 17:42:34,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 17:42:34,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:34,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:34,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-16 17:42:34,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:34,269 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-16 17:42:34,306 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-16 17:42:34,306 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 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-16 17:42:34,335 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 17 treesize of output 13 [2025-03-16 17:42:34,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:34,361 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 30 treesize of output 17 [2025-03-16 17:42:34,379 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 18 [2025-03-16 17:42:34,401 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-16 17:42:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:42:34,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:34,419 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 66 treesize of output 62 [2025-03-16 17:42:34,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:34,504 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-16 17:42:34,507 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 51 treesize of output 39 [2025-03-16 17:42:34,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:34,522 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-03-16 17:42:34,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:34,530 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 63 treesize of output 62 [2025-03-16 17:42:34,536 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 38 treesize of output 34 [2025-03-16 17:42:34,572 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 26 treesize of output 14 [2025-03-16 17:42:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:42:34,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135572453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:42:34,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:42:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 20 [2025-03-16 17:42:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697783008] [2025-03-16 17:42:34,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:42:34,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 17:42:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:34,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 17:42:34,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=330, Unknown=5, NotChecked=0, Total=380 [2025-03-16 17:42:34,637 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:34,904 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-03-16 17:42:34,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 17:42:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 17:42:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:34,905 INFO L225 Difference]: With dead ends: 43 [2025-03-16 17:42:34,905 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 17:42:34,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=609, Unknown=5, NotChecked=0, Total=702 [2025-03-16 17:42:34,906 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:34,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:42:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 17:42:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-16 17:42:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-03-16 17:42:34,908 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2025-03-16 17:42:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:34,908 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-03-16 17:42:34,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:42:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-03-16 17:42:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 17:42:34,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:34,908 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:34,916 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-16 17:42:35,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:35,113 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:35,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1995785606, now seen corresponding path program 2 times [2025-03-16 17:42:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:35,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-03-16 17:42:35,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:42:35,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:35,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-16 17:42:35,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 17:42:35,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:42:35,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:36,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-03-16 17:42:36,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125919774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:36,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246532333] [2025-03-16 17:42:36,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:42:36,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:36,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:36,405 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-16 17:42:36,406 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-16 17:42:36,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-16 17:42:36,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 17:42:36,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:42:36,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:36,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-16 17:42:36,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:36,578 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-16 17:42:36,610 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 25 treesize of output 7 [2025-03-16 17:42:36,683 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:42:36,683 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-16 17:42:36,736 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-16 17:42:36,740 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 16 treesize of output 11 [2025-03-16 17:42:36,746 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 14 treesize of output 15 [2025-03-16 17:42:36,801 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:42:36,801 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 88 treesize of output 75 [2025-03-16 17:42:36,805 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 31 treesize of output 16 [2025-03-16 17:42:36,812 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 39 treesize of output 15 [2025-03-16 17:42:36,926 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:42:36,927 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 28 treesize of output 30 [2025-03-16 17:42:36,997 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2025-03-16 17:42:37,001 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 31 treesize of output 20 [2025-03-16 17:42:37,011 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2025-03-16 17:42:37,015 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 52 treesize of output 35 [2025-03-16 17:42:37,021 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 24 treesize of output 19 [2025-03-16 17:42:37,099 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:42:37,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:37,102 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:42:37,102 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 62 [2025-03-16 17:42:37,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:37,114 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 32 treesize of output 19 [2025-03-16 17:42:37,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:37,131 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:42:37,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:37,132 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:42:37,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2025-03-16 17:42:37,207 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 119 treesize of output 75 [2025-03-16 17:42:37,424 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2025-03-16 17:42:37,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 56 [2025-03-16 17:42:37,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-16 17:42:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:37,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:37,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:37,832 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 596 treesize of output 536 [2025-03-16 17:42:37,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:37,840 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 524 treesize of output 464 [2025-03-16 17:42:38,103 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 314 treesize of output 234 [2025-03-16 17:42:38,107 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 278 treesize of output 238 [2025-03-16 17:42:38,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_864 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_855 Int) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_11 4))) (let ((.cse3 (select v_arrayElimArr_10 4)) (.cse9 (+ 8 .cse4))) (let ((.cse7 (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_852) |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_arrayElimArr_11))) (store .cse10 .cse3 (store (select .cse10 .cse3) .cse9 0)))) (.cse5 (let ((.cse8 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_851) |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_arrayElimArr_10))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse9 |v_ULTIMATE.start_node_create_~temp~0#1.base_13|))))) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_855)) |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_857) .cse3 v_ArrVal_864)) (.cse1 (select (select .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_13|) 4)) (.cse2 (select (select .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_13|) 4))) (or (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (+ .cse2 4))) (select (select .cse0 (select (select .cse5 .cse1) .cse6)) (select (select .cse7 .cse1) .cse6)))))))))) is different from false [2025-03-16 17:42:38,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:38,430 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 564 treesize of output 464 [2025-03-16 17:42:38,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:38,446 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 444 treesize of output 344 [2025-03-16 17:42:38,526 INFO L349 Elim1Store]: treesize reduction 36, result has 67.0 percent of original size [2025-03-16 17:42:38,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 34944 treesize of output 32929 [2025-03-16 17:42:38,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:38,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 8527 treesize of output 6973 [2025-03-16 17:42:38,625 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 13183 treesize of output 13063 [2025-03-16 17:42:38,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:38,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 179 treesize of output 179 [2025-03-16 17:42:38,701 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 85 treesize of output 79 [2025-03-16 17:42:38,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:38,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 1190 treesize of output 1058 [2025-03-16 17:42:38,750 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 92 treesize of output 80 [2025-03-16 17:42:38,819 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 80 treesize of output 72 [2025-03-16 17:42:39,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,274 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:39,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,382 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2025-03-16 17:42:39,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,415 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:39,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,434 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:39,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2025-03-16 17:42:39,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,461 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:39,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,555 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:39,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,570 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2025-03-16 17:42:39,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,604 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:39,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,619 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:39,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,668 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:39,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,687 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2025-03-16 17:42:39,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,706 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:39,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,753 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:39,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,804 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:39,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,823 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:39,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,995 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:40,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:40,017 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:40,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:40,036 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:40,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:40,609 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:40,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:40,649 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:40,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:40,661 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:40,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:40,679 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:40,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:40,883 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:40,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:40,905 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:40,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:40,918 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:41,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:41,062 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-16 17:42:42,156 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-16 17:42:42,157 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 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-16 17:42:42,179 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-16 17:42:42,179 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 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-16 17:42:42,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:42,183 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-16 17:42:42,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:42,187 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-16 17:42:42,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:42,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:42,554 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:42:42,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:42,592 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-16 17:42:42,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:42,854 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-16 17:42:42,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:42,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1