./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:45:41,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:45:41,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:45:41,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:45:41,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:45:41,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:45:41,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:45:41,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:45:41,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:45:41,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:45:41,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:45:41,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:45:41,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:45:41,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:45:41,342 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:45:41,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:45:41,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:45:41,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:45:41,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:45:41,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:45:41,343 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:45:41,343 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:45:41,343 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:45:41,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:45:41,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:45:41,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:45:41,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:45:41,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:45:41,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:45:41,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:45:41,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:45:41,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:45:41,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:45:41,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:45:41,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:45:41,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:45:41,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:45:41,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:45:41,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:45:41,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:45:41,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:45:41,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:45:41,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:45:41,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:45:41,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:45:41,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:45:41,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:45:41,346 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2025-01-09 22:45:41,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:45:41,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:45:41,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:45:41,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:45:41,606 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:45:41,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2025-01-09 22:45:42,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b531938e2/19a9b6e491834502b4258031c7338f22/FLAG5d10d0eb8 [2025-01-09 22:45:43,203 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:45:43,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2025-01-09 22:45:43,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b531938e2/19a9b6e491834502b4258031c7338f22/FLAG5d10d0eb8 [2025-01-09 22:45:43,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b531938e2/19a9b6e491834502b4258031c7338f22 [2025-01-09 22:45:43,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:45:43,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:45:43,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:45:43,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:45:43,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:45:43,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7657039c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43, skipping insertion in model container [2025-01-09 22:45:43,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:45:43,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:45:43,582 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:45:43,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:45:43,647 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:45:43,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43 WrapperNode [2025-01-09 22:45:43,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:45:43,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:45:43,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:45:43,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:45:43,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,690 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-01-09 22:45:43,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:45:43,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:45:43,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:45:43,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:45:43,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,724 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2025-01-09 22:45:43,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:45:43,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:45:43,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:45:43,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:45:43,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (1/1) ... [2025-01-09 22:45:43,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:45:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:43,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:45:43,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:45:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-01-09 22:45:43,800 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:45:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:45:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:45:43,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:45:43,919 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:45:43,921 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:45:43,946 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-01-09 22:45:44,329 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-01-09 22:45:44,329 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:45:44,342 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:45:44,343 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:45:44,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:45:44 BoogieIcfgContainer [2025-01-09 22:45:44,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:45:44,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:45:44,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:45:44,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:45:44,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:45:43" (1/3) ... [2025-01-09 22:45:44,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b76ef33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:45:44, skipping insertion in model container [2025-01-09 22:45:44,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:45:43" (2/3) ... [2025-01-09 22:45:44,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b76ef33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:45:44, skipping insertion in model container [2025-01-09 22:45:44,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:45:44" (3/3) ... [2025-01-09 22:45:44,354 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2025-01-09 22:45:44,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:45:44,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_of_sll_nondet_append-1.i that has 2 procedures, 120 locations, 1 initial locations, 9 loop locations, and 42 error locations. [2025-01-09 22:45:44,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:45:44,413 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=None, 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;@17a4ce76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:45:44,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-01-09 22:45:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 74 states have (on average 1.837837837837838) internal successors, (136), 117 states have internal predecessors, (136), 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-01-09 22:45:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:45:44,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:44,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:45:44,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1082725, now seen corresponding path program 1 times [2025-01-09 22:45:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:44,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014072509] [2025-01-09 22:45:44,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:44,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:44,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:45:44,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:45:44,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:44,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014072509] [2025-01-09 22:45:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014072509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:44,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:45:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859255001] [2025-01-09 22:45:44,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:44,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:45:44,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:44,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:45:44,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:45:44,658 INFO L87 Difference]: Start difference. First operand has 119 states, 74 states have (on average 1.837837837837838) internal successors, (136), 117 states have internal predecessors, (136), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:45:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:44,792 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2025-01-09 22:45:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:45:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-01-09 22:45:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:44,804 INFO L225 Difference]: With dead ends: 143 [2025-01-09 22:45:44,804 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 22:45:44,807 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-01-09 22:45:44,810 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 114 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:44,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 111 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:44,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 22:45:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2025-01-09 22:45:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 109 states have internal predecessors, (123), 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-01-09 22:45:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2025-01-09 22:45:44,855 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 4 [2025-01-09 22:45:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:44,855 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2025-01-09 22:45:44,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:45:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2025-01-09 22:45:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:45:44,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:44,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:45:44,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:45:44,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:44,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:44,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1082726, now seen corresponding path program 1 times [2025-01-09 22:45:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:44,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123513092] [2025-01-09 22:45:44,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:44,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:44,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:45:44,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:45:44,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:44,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:44,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:44,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123513092] [2025-01-09 22:45:44,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123513092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:44,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:44,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:45:44,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181895707] [2025-01-09 22:45:44,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:44,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:45:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:44,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:45:44,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:45:44,953 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:45:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:44,994 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2025-01-09 22:45:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:45:44,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-01-09 22:45:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:44,996 INFO L225 Difference]: With dead ends: 157 [2025-01-09 22:45:44,996 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 22:45:44,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:45:44,997 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 51 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:44,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 228 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:45:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 22:45:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 111. [2025-01-09 22:45:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 110 states have internal predecessors, (124), 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-01-09 22:45:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2025-01-09 22:45:45,005 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 4 [2025-01-09 22:45:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:45,005 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2025-01-09 22:45:45,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:45:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2025-01-09 22:45:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:45:45,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:45,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:45,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:45:45,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash 290467648, now seen corresponding path program 1 times [2025-01-09 22:45:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995702796] [2025-01-09 22:45:45,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:45,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:45,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:45:45,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:45:45,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:45,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995702796] [2025-01-09 22:45:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995702796] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544460101] [2025-01-09 22:45:45,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:45,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:45,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:45:45,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:45:45,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:45:45,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:45:45,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:45,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:45,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:45:45,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:45,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:45,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544460101] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:45:45,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:45:45,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 22:45:45,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861097211] [2025-01-09 22:45:45,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:45,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:45:45,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:45,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:45:45,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:45:45,342 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-01-09 22:45:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:45,414 INFO L93 Difference]: Finished difference Result 241 states and 266 transitions. [2025-01-09 22:45:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:45:45,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Word has length 9 [2025-01-09 22:45:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:45,416 INFO L225 Difference]: With dead ends: 241 [2025-01-09 22:45:45,416 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 22:45:45,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:45:45,417 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 299 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:45,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 430 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:45:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 22:45:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 172. [2025-01-09 22:45:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.7575757575757576) internal successors, (232), 171 states have internal predecessors, (232), 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-01-09 22:45:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2025-01-09 22:45:45,433 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 9 [2025-01-09 22:45:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:45,433 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2025-01-09 22:45:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-01-09 22:45:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2025-01-09 22:45:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:45:45,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:45,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:45,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:45:45,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:45,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:45,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash -880200826, now seen corresponding path program 1 times [2025-01-09 22:45:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:45,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123449804] [2025-01-09 22:45:45,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:45,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:45,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:45:45,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:45:45,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:45,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:45,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123449804] [2025-01-09 22:45:45,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123449804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:45,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:45,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:45:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200286645] [2025-01-09 22:45:45,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:45,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:45:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:45,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:45:45,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:45:45,751 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:45:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:45,834 INFO L93 Difference]: Finished difference Result 170 states and 226 transitions. [2025-01-09 22:45:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:45:45,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-01-09 22:45:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:45,838 INFO L225 Difference]: With dead ends: 170 [2025-01-09 22:45:45,840 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 22:45:45,840 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-01-09 22:45:45,841 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:45,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 181 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 22:45:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 22:45:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 132 states have (on average 1.7121212121212122) internal successors, (226), 169 states have internal predecessors, (226), 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-01-09 22:45:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 226 transitions. [2025-01-09 22:45:45,858 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 226 transitions. Word has length 12 [2025-01-09 22:45:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:45,858 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 226 transitions. [2025-01-09 22:45:45,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:45:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 226 transitions. [2025-01-09 22:45:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:45:45,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:45,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:45,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:45:45,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:45,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash -880200825, now seen corresponding path program 1 times [2025-01-09 22:45:45,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:45,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738725602] [2025-01-09 22:45:45,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:45,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:45,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:45:45,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:45:45,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:45,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:46,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:46,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738725602] [2025-01-09 22:45:46,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738725602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:46,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:46,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:45:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874799470] [2025-01-09 22:45:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:46,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:45:46,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:46,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:45:46,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:45:46,057 INFO L87 Difference]: Start difference. First operand 170 states and 226 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-01-09 22:45:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:46,153 INFO L93 Difference]: Finished difference Result 241 states and 310 transitions. [2025-01-09 22:45:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:45:46,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-01-09 22:45:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:46,157 INFO L225 Difference]: With dead ends: 241 [2025-01-09 22:45:46,159 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 22:45:46,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:45:46,162 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 114 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:46,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 556 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 22:45:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 173. [2025-01-09 22:45:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 135 states have (on average 1.6962962962962962) internal successors, (229), 172 states have internal predecessors, (229), 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-01-09 22:45:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2025-01-09 22:45:46,179 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 12 [2025-01-09 22:45:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:46,179 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2025-01-09 22:45:46,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-01-09 22:45:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2025-01-09 22:45:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:45:46,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:46,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:46,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:45:46,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash -880213606, now seen corresponding path program 1 times [2025-01-09 22:45:46,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:46,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635218210] [2025-01-09 22:45:46,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:46,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:45:46,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:45:46,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:46,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:46,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635218210] [2025-01-09 22:45:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635218210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:46,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:45:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23827000] [2025-01-09 22:45:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:46,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:45:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:46,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:45:46,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:45:46,266 INFO L87 Difference]: Start difference. First operand 173 states and 229 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:45:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:46,337 INFO L93 Difference]: Finished difference Result 172 states and 226 transitions. [2025-01-09 22:45:46,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:45:46,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-01-09 22:45:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:46,339 INFO L225 Difference]: With dead ends: 172 [2025-01-09 22:45:46,339 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 22:45:46,339 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-01-09 22:45:46,340 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:46,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 192 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 22:45:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-01-09 22:45:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.674074074074074) internal successors, (226), 171 states have internal predecessors, (226), 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-01-09 22:45:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 226 transitions. [2025-01-09 22:45:46,350 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 226 transitions. Word has length 12 [2025-01-09 22:45:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:46,350 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 226 transitions. [2025-01-09 22:45:46,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:45:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 226 transitions. [2025-01-09 22:45:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:45:46,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:46,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:46,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:45:46,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:46,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -880213605, now seen corresponding path program 1 times [2025-01-09 22:45:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:46,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577085845] [2025-01-09 22:45:46,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:46,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:45:46,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:45:46,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:46,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577085845] [2025-01-09 22:45:46,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577085845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:46,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:46,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:45:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401126392] [2025-01-09 22:45:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:46,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:45:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:46,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:45:46,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:45:46,463 INFO L87 Difference]: Start difference. First operand 172 states and 226 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:45:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:46,525 INFO L93 Difference]: Finished difference Result 171 states and 223 transitions. [2025-01-09 22:45:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:45:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-01-09 22:45:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:46,527 INFO L225 Difference]: With dead ends: 171 [2025-01-09 22:45:46,527 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 22:45:46,527 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-01-09 22:45:46,528 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:46,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 22:45:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-01-09 22:45:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 135 states have (on average 1.651851851851852) internal successors, (223), 170 states have internal predecessors, (223), 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-01-09 22:45:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2025-01-09 22:45:46,540 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 12 [2025-01-09 22:45:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:46,541 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2025-01-09 22:45:46,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:45:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2025-01-09 22:45:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:45:46,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:46,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:46,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:45:46,541 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:46,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash -173766178, now seen corresponding path program 1 times [2025-01-09 22:45:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784867300] [2025-01-09 22:45:46,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:46,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:45:46,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:45:46,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:46,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:46,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:46,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784867300] [2025-01-09 22:45:46,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784867300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:46,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548101338] [2025-01-09 22:45:46,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:46,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:46,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:46,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:45:46,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:45:46,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:45:46,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:45:46,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:46,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:46,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:45:46,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:46,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:45:46,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548101338] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:45:46,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:45:46,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-09 22:45:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995014593] [2025-01-09 22:45:46,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:46,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:45:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:46,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:45:46,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:45:46,918 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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-01-09 22:45:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:47,097 INFO L93 Difference]: Finished difference Result 252 states and 313 transitions. [2025-01-09 22:45:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:45:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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 16 [2025-01-09 22:45:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:47,099 INFO L225 Difference]: With dead ends: 252 [2025-01-09 22:45:47,099 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 22:45:47,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:45:47,100 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 113 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:47,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1096 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 22:45:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 195. [2025-01-09 22:45:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 194 states have internal predecessors, (247), 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-01-09 22:45:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 247 transitions. [2025-01-09 22:45:47,106 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 247 transitions. Word has length 16 [2025-01-09 22:45:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:47,107 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 247 transitions. [2025-01-09 22:45:47,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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-01-09 22:45:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2025-01-09 22:45:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:45:47,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:47,108 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1] [2025-01-09 22:45:47,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:45:47,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:47,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:47,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1504919296, now seen corresponding path program 2 times [2025-01-09 22:45:47,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:47,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7008258] [2025-01-09 22:45:47,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:45:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:47,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-09 22:45:47,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 19 statements. [2025-01-09 22:45:47,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:45:47,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:45:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7008258] [2025-01-09 22:45:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7008258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:45:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125734977] [2025-01-09 22:45:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:47,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:45:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:47,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:45:47,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:45:47,364 INFO L87 Difference]: Start difference. First operand 195 states and 247 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-01-09 22:45:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:47,438 INFO L93 Difference]: Finished difference Result 245 states and 311 transitions. [2025-01-09 22:45:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:45:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 19 [2025-01-09 22:45:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:47,440 INFO L225 Difference]: With dead ends: 245 [2025-01-09 22:45:47,440 INFO L226 Difference]: Without dead ends: 245 [2025-01-09 22:45:47,440 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-01-09 22:45:47,441 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:47,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 191 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-09 22:45:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 232. [2025-01-09 22:45:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 196 states have (on average 1.5561224489795917) internal successors, (305), 231 states have internal predecessors, (305), 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-01-09 22:45:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 305 transitions. [2025-01-09 22:45:47,446 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 305 transitions. Word has length 19 [2025-01-09 22:45:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:47,446 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 305 transitions. [2025-01-09 22:45:47,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-01-09 22:45:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 305 transitions. [2025-01-09 22:45:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:45:47,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:47,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:47,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:45:47,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:47,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1701450740, now seen corresponding path program 2 times [2025-01-09 22:45:47,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:47,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851562901] [2025-01-09 22:45:47,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:45:47,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:47,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 22:45:47,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:45:47,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:45:47,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:45:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:47,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851562901] [2025-01-09 22:45:47,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851562901] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:47,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455699654] [2025-01-09 22:45:47,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:45:47,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:47,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:47,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:45:47,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:45:47,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 22:45:47,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:45:47,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:45:47,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:47,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:45:47,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:47,904 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-01-09 22:45:47,916 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 8 treesize of output 1 [2025-01-09 22:45:47,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:47,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:45:47,996 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:45:47,996 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 19 treesize of output 16 [2025-01-09 22:45:48,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:48,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:45:48,083 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:45:48,084 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-01-09 22:45:48,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:48,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:45:48,224 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 22:45:48,225 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 16 treesize of output 18 [2025-01-09 22:45:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:45:48,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:45:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455699654] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:45:48,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:45:48,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-09 22:45:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115356520] [2025-01-09 22:45:48,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:45:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:48,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:45:48,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:45:48,998 INFO L87 Difference]: Start difference. First operand 232 states and 305 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 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-01-09 22:45:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:49,267 INFO L93 Difference]: Finished difference Result 230 states and 299 transitions. [2025-01-09 22:45:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:45:49,268 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 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 24 [2025-01-09 22:45:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:49,269 INFO L225 Difference]: With dead ends: 230 [2025-01-09 22:45:49,269 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 22:45:49,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:45:49,269 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 21 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:49,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 423 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:45:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 22:45:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-01-09 22:45:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 196 states have (on average 1.5255102040816326) internal successors, (299), 229 states have internal predecessors, (299), 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-01-09 22:45:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 299 transitions. [2025-01-09 22:45:49,276 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 299 transitions. Word has length 24 [2025-01-09 22:45:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:49,276 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 299 transitions. [2025-01-09 22:45:49,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 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-01-09 22:45:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 299 transitions. [2025-01-09 22:45:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:45:49,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:49,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:49,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:45:49,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:49,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:49,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1116760219, now seen corresponding path program 1 times [2025-01-09 22:45:49,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:49,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473219636] [2025-01-09 22:45:49,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:49,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:49,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:45:49,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:45:49,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:49,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:45:49,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:49,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473219636] [2025-01-09 22:45:49,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473219636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:49,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:49,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:45:49,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420624028] [2025-01-09 22:45:49,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:49,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:45:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:49,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:45:49,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:45:49,569 INFO L87 Difference]: Start difference. First operand 230 states and 299 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-01-09 22:45:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:49,645 INFO L93 Difference]: Finished difference Result 344 states and 441 transitions. [2025-01-09 22:45:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:45:49,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 24 [2025-01-09 22:45:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:49,646 INFO L225 Difference]: With dead ends: 344 [2025-01-09 22:45:49,646 INFO L226 Difference]: Without dead ends: 344 [2025-01-09 22:45:49,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:45:49,647 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:49,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 429 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:45:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-09 22:45:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 327. [2025-01-09 22:45:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 293 states have (on average 1.4641638225255973) internal successors, (429), 326 states have internal predecessors, (429), 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-01-09 22:45:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 429 transitions. [2025-01-09 22:45:49,657 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 429 transitions. Word has length 24 [2025-01-09 22:45:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:49,658 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 429 transitions. [2025-01-09 22:45:49,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-01-09 22:45:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 429 transitions. [2025-01-09 22:45:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:45:49,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:49,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:49,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:45:49,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:49,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash 309328347, now seen corresponding path program 1 times [2025-01-09 22:45:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:49,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125745974] [2025-01-09 22:45:49,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:49,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:45:49,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:45:49,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:49,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:45:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:49,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125745974] [2025-01-09 22:45:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125745974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:45:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207683861] [2025-01-09 22:45:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:49,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:45:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:49,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:45:49,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:45:49,756 INFO L87 Difference]: Start difference. First operand 327 states and 429 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-01-09 22:45:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:49,813 INFO L93 Difference]: Finished difference Result 346 states and 443 transitions. [2025-01-09 22:45:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:45:49,813 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 25 [2025-01-09 22:45:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:49,815 INFO L225 Difference]: With dead ends: 346 [2025-01-09 22:45:49,815 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 22:45:49,815 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-01-09 22:45:49,815 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:49,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 423 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:45:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 22:45:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 331. [2025-01-09 22:45:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 297 states have (on average 1.4612794612794613) internal successors, (434), 330 states have internal predecessors, (434), 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-01-09 22:45:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 434 transitions. [2025-01-09 22:45:49,822 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 434 transitions. Word has length 25 [2025-01-09 22:45:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:49,822 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 434 transitions. [2025-01-09 22:45:49,822 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-01-09 22:45:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 434 transitions. [2025-01-09 22:45:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:45:49,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:49,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:49,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:45:49,823 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:49,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 999276134, now seen corresponding path program 1 times [2025-01-09 22:45:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:49,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17962464] [2025-01-09 22:45:49,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:49,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:49,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:45:49,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:45:49,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:49,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:45:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17962464] [2025-01-09 22:45:49,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17962464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:49,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:49,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:45:49,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469620576] [2025-01-09 22:45:49,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:49,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:45:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:49,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:45:49,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:45:49,950 INFO L87 Difference]: Start difference. First operand 331 states and 434 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-01-09 22:45:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:50,031 INFO L93 Difference]: Finished difference Result 338 states and 440 transitions. [2025-01-09 22:45:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:45:50,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 26 [2025-01-09 22:45:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:50,034 INFO L225 Difference]: With dead ends: 338 [2025-01-09 22:45:50,034 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 22:45:50,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:45:50,035 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:50,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 267 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 22:45:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 325. [2025-01-09 22:45:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 291 states have (on average 1.4673539518900343) internal successors, (427), 324 states have internal predecessors, (427), 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-01-09 22:45:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 427 transitions. [2025-01-09 22:45:50,042 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 427 transitions. Word has length 26 [2025-01-09 22:45:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:50,042 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 427 transitions. [2025-01-09 22:45:50,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-01-09 22:45:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2025-01-09 22:45:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:45:50,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:50,043 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:50,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:45:50,043 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:50,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2035699754, now seen corresponding path program 1 times [2025-01-09 22:45:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:50,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372664158] [2025-01-09 22:45:50,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:50,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:50,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:45:50,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:45:50,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:50,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:45:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372664158] [2025-01-09 22:45:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372664158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:45:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968929686] [2025-01-09 22:45:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:50,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:45:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:50,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:45:50,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:45:50,140 INFO L87 Difference]: Start difference. First operand 325 states and 427 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-01-09 22:45:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:50,240 INFO L93 Difference]: Finished difference Result 324 states and 421 transitions. [2025-01-09 22:45:50,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:45:50,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 29 [2025-01-09 22:45:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:50,243 INFO L225 Difference]: With dead ends: 324 [2025-01-09 22:45:50,243 INFO L226 Difference]: Without dead ends: 324 [2025-01-09 22:45:50,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:45:50,244 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 27 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:50,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 301 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-09 22:45:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-01-09 22:45:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 291 states have (on average 1.4467353951890034) internal successors, (421), 323 states have internal predecessors, (421), 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-01-09 22:45:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 421 transitions. [2025-01-09 22:45:50,251 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 421 transitions. Word has length 29 [2025-01-09 22:45:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:50,252 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 421 transitions. [2025-01-09 22:45:50,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-01-09 22:45:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 421 transitions. [2025-01-09 22:45:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:45:50,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:50,253 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:50,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:45:50,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:50,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2035699753, now seen corresponding path program 1 times [2025-01-09 22:45:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:50,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610667671] [2025-01-09 22:45:50,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:50,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:50,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:45:50,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:45:50,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:50,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:45:50,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:50,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610667671] [2025-01-09 22:45:50,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610667671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:50,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:50,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:45:50,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733727494] [2025-01-09 22:45:50,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:50,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:45:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:50,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:45:50,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:45:50,432 INFO L87 Difference]: Start difference. First operand 324 states and 421 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-01-09 22:45:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:50,531 INFO L93 Difference]: Finished difference Result 323 states and 415 transitions. [2025-01-09 22:45:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:45:50,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 29 [2025-01-09 22:45:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:50,533 INFO L225 Difference]: With dead ends: 323 [2025-01-09 22:45:50,534 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 22:45:50,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:45:50,536 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 27 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:50,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 403 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 22:45:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-01-09 22:45:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 291 states have (on average 1.4261168384879725) internal successors, (415), 322 states have internal predecessors, (415), 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-01-09 22:45:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 415 transitions. [2025-01-09 22:45:50,545 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 415 transitions. Word has length 29 [2025-01-09 22:45:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:50,545 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 415 transitions. [2025-01-09 22:45:50,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-01-09 22:45:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 415 transitions. [2025-01-09 22:45:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:45:50,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:50,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:50,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:45:50,549 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:50,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1317817105, now seen corresponding path program 1 times [2025-01-09 22:45:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443301415] [2025-01-09 22:45:50,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:50,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:45:50,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:45:50,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:50,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:45:50,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:50,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443301415] [2025-01-09 22:45:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443301415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:50,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703041813] [2025-01-09 22:45:50,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:50,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:50,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:50,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:45:50,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:45:51,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:45:51,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:45:51,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:51,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:51,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:45:51,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:51,055 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-01-09 22:45:51,096 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:45:51,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:45:51,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:51,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-09 22:45:51,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:51,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-09 22:45:51,205 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-01-09 22:45:51,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2025-01-09 22:45:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:45:51,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:45:51,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703041813] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:45:51,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:45:51,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2025-01-09 22:45:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891325347] [2025-01-09 22:45:51,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:51,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:45:51,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:51,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:45:51,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:45:51,704 INFO L87 Difference]: Start difference. First operand 323 states and 415 transitions. Second operand has 16 states, 15 states have (on average 4.933333333333334) internal successors, (74), 16 states have internal predecessors, (74), 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-01-09 22:45:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:51,922 INFO L93 Difference]: Finished difference Result 351 states and 438 transitions. [2025-01-09 22:45:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:45:51,922 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.933333333333334) internal successors, (74), 16 states have internal predecessors, (74), 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 30 [2025-01-09 22:45:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:51,923 INFO L225 Difference]: With dead ends: 351 [2025-01-09 22:45:51,924 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 22:45:51,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:45:51,924 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 339 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:51,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 387 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:45:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 22:45:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 321. [2025-01-09 22:45:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 291 states have (on average 1.395189003436426) internal successors, (406), 320 states have internal predecessors, (406), 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-01-09 22:45:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 406 transitions. [2025-01-09 22:45:51,931 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 406 transitions. Word has length 30 [2025-01-09 22:45:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:51,931 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 406 transitions. [2025-01-09 22:45:51,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.933333333333334) internal successors, (74), 16 states have internal predecessors, (74), 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-01-09 22:45:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 406 transitions. [2025-01-09 22:45:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:45:51,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:51,932 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:51,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:45:52,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 22:45:52,135 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:52,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1317817106, now seen corresponding path program 1 times [2025-01-09 22:45:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:52,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795705949] [2025-01-09 22:45:52,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:52,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:45:52,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:45:52,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:52,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:45:52,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:52,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795705949] [2025-01-09 22:45:52,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795705949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610578516] [2025-01-09 22:45:52,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:52,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:52,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:52,481 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:45:52,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:45:52,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:45:52,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:45:52,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:52,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:52,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 22:45:52,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:52,600 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 8 treesize of output 1 [2025-01-09 22:45:52,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:52,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:45:52,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:52,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:45:52,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:52,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:45:52,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:52,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:45:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:45:52,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:45:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610578516] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:45:53,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:45:53,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-01-09 22:45:53,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681570783] [2025-01-09 22:45:53,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:53,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:45:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:53,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:45:53,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:45:53,235 INFO L87 Difference]: Start difference. First operand 321 states and 406 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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-01-09 22:45:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:53,417 INFO L93 Difference]: Finished difference Result 320 states and 396 transitions. [2025-01-09 22:45:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:45:53,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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 30 [2025-01-09 22:45:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:53,419 INFO L225 Difference]: With dead ends: 320 [2025-01-09 22:45:53,419 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 22:45:53,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:45:53,420 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 120 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:53,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 297 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 22:45:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2025-01-09 22:45:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 291 states have (on average 1.3505154639175259) internal successors, (393), 316 states have internal predecessors, (393), 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-01-09 22:45:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 393 transitions. [2025-01-09 22:45:53,429 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 393 transitions. Word has length 30 [2025-01-09 22:45:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:53,429 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 393 transitions. [2025-01-09 22:45:53,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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-01-09 22:45:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 393 transitions. [2025-01-09 22:45:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:45:53,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:53,429 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:53,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:45:53,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 22:45:53,630 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:53,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1206635875, now seen corresponding path program 1 times [2025-01-09 22:45:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:53,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024177511] [2025-01-09 22:45:53,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:53,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:45:53,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:45:53,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:53,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:45:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024177511] [2025-01-09 22:45:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024177511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:53,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:53,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:45:53,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496479179] [2025-01-09 22:45:53,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:53,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:45:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:53,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:45:53,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:45:53,787 INFO L87 Difference]: Start difference. First operand 317 states and 393 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-01-09 22:45:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:53,861 INFO L93 Difference]: Finished difference Result 281 states and 326 transitions. [2025-01-09 22:45:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:45:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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) Word has length 33 [2025-01-09 22:45:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:53,862 INFO L225 Difference]: With dead ends: 281 [2025-01-09 22:45:53,862 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 22:45:53,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:45:53,863 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 24 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:53,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 503 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:45:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 22:45:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2025-01-09 22:45:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 252 states have (on average 1.2817460317460319) internal successors, (323), 277 states have internal predecessors, (323), 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-01-09 22:45:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 323 transitions. [2025-01-09 22:45:53,869 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 323 transitions. Word has length 33 [2025-01-09 22:45:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:53,869 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 323 transitions. [2025-01-09 22:45:53,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-01-09 22:45:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 323 transitions. [2025-01-09 22:45:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:45:53,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:53,870 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:53,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:45:53,870 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:53,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash -150669036, now seen corresponding path program 1 times [2025-01-09 22:45:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524752898] [2025-01-09 22:45:53,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:53,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:45:53,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:45:53,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:53,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 22:45:54,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:54,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524752898] [2025-01-09 22:45:54,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524752898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:54,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:45:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506768917] [2025-01-09 22:45:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:54,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:45:54,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:54,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:45:54,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:45:54,143 INFO L87 Difference]: Start difference. First operand 278 states and 323 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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-01-09 22:45:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:54,417 INFO L93 Difference]: Finished difference Result 287 states and 334 transitions. [2025-01-09 22:45:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:45:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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 55 [2025-01-09 22:45:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:54,419 INFO L225 Difference]: With dead ends: 287 [2025-01-09 22:45:54,419 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 22:45:54,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:45:54,420 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 111 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:54,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 488 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:45:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 22:45:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2025-01-09 22:45:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 254 states have (on average 1.2834645669291338) internal successors, (326), 278 states have internal predecessors, (326), 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-01-09 22:45:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 326 transitions. [2025-01-09 22:45:54,427 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 326 transitions. Word has length 55 [2025-01-09 22:45:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:54,428 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 326 transitions. [2025-01-09 22:45:54,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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-01-09 22:45:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 326 transitions. [2025-01-09 22:45:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:45:54,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:54,429 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:54,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:45:54,429 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:54,430 INFO L85 PathProgramCache]: Analyzing trace with hash -150669035, now seen corresponding path program 1 times [2025-01-09 22:45:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318747565] [2025-01-09 22:45:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:54,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:45:54,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:45:54,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:54,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 22:45:54,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:54,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318747565] [2025-01-09 22:45:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318747565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:45:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770599794] [2025-01-09 22:45:54,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:54,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:45:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:54,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:45:54,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:45:54,879 INFO L87 Difference]: Start difference. First operand 279 states and 326 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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-01-09 22:45:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:55,169 INFO L93 Difference]: Finished difference Result 307 states and 361 transitions. [2025-01-09 22:45:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:45:55,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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 55 [2025-01-09 22:45:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:55,171 INFO L225 Difference]: With dead ends: 307 [2025-01-09 22:45:55,171 INFO L226 Difference]: Without dead ends: 307 [2025-01-09 22:45:55,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:45:55,172 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:55,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 605 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:45:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-09 22:45:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 296. [2025-01-09 22:45:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 271 states have (on average 1.3025830258302582) internal successors, (353), 295 states have internal predecessors, (353), 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-01-09 22:45:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 353 transitions. [2025-01-09 22:45:55,183 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 353 transitions. Word has length 55 [2025-01-09 22:45:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:55,183 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 353 transitions. [2025-01-09 22:45:55,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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-01-09 22:45:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 353 transitions. [2025-01-09 22:45:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:45:55,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:55,183 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:55,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:45:55,184 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:55,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:55,184 INFO L85 PathProgramCache]: Analyzing trace with hash -375745785, now seen corresponding path program 1 times [2025-01-09 22:45:55,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:55,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490019619] [2025-01-09 22:45:55,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:55,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:55,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:45:55,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:45:55,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:55,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 22:45:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490019619] [2025-01-09 22:45:55,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490019619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:55,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:55,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:45:55,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406086781] [2025-01-09 22:45:55,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:55,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:45:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:55,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:45:55,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:45:55,258 INFO L87 Difference]: Start difference. First operand 296 states and 353 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-01-09 22:45:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:55,295 INFO L93 Difference]: Finished difference Result 367 states and 432 transitions. [2025-01-09 22:45:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:45:55,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 56 [2025-01-09 22:45:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:55,297 INFO L225 Difference]: With dead ends: 367 [2025-01-09 22:45:55,297 INFO L226 Difference]: Without dead ends: 367 [2025-01-09 22:45:55,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:45:55,298 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 122 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:55,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 243 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:45:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-01-09 22:45:55,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 296. [2025-01-09 22:45:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 271 states have (on average 1.3025830258302582) internal successors, (353), 295 states have internal predecessors, (353), 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-01-09 22:45:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 353 transitions. [2025-01-09 22:45:55,304 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 353 transitions. Word has length 56 [2025-01-09 22:45:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:55,304 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 353 transitions. [2025-01-09 22:45:55,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-01-09 22:45:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 353 transitions. [2025-01-09 22:45:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:45:55,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:55,305 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:55,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:45:55,306 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:55,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash -326272894, now seen corresponding path program 1 times [2025-01-09 22:45:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:55,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579652289] [2025-01-09 22:45:55,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:55,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:45:55,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:45:55,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:55,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 22:45:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:55,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579652289] [2025-01-09 22:45:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579652289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:55,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:55,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:45:55,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376584905] [2025-01-09 22:45:55,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:55,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:45:55,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:55,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:45:55,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:45:55,450 INFO L87 Difference]: Start difference. First operand 296 states and 353 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-01-09 22:45:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:55,541 INFO L93 Difference]: Finished difference Result 310 states and 364 transitions. [2025-01-09 22:45:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:45:55,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 56 [2025-01-09 22:45:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:55,545 INFO L225 Difference]: With dead ends: 310 [2025-01-09 22:45:55,545 INFO L226 Difference]: Without dead ends: 310 [2025-01-09 22:45:55,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:45:55,546 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:55,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 543 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-01-09 22:45:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 301. [2025-01-09 22:45:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 276 states have (on average 1.2971014492753623) internal successors, (358), 300 states have internal predecessors, (358), 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-01-09 22:45:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 358 transitions. [2025-01-09 22:45:55,553 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 358 transitions. Word has length 56 [2025-01-09 22:45:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:55,553 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 358 transitions. [2025-01-09 22:45:55,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-01-09 22:45:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 358 transitions. [2025-01-09 22:45:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 22:45:55,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:55,554 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:55,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:45:55,554 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:55,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1524493153, now seen corresponding path program 1 times [2025-01-09 22:45:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:55,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353767962] [2025-01-09 22:45:55,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:55,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:55,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 22:45:55,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:45:55,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:55,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 22:45:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353767962] [2025-01-09 22:45:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353767962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:55,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:45:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207202045] [2025-01-09 22:45:55,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:55,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:45:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:55,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:45:55,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:45:55,768 INFO L87 Difference]: Start difference. First operand 301 states and 358 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-01-09 22:45:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:55,931 INFO L93 Difference]: Finished difference Result 305 states and 356 transitions. [2025-01-09 22:45:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:45:55,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 57 [2025-01-09 22:45:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:55,933 INFO L225 Difference]: With dead ends: 305 [2025-01-09 22:45:55,933 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 22:45:55,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:45:55,934 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 125 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:55,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 650 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:45:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 22:45:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 296. [2025-01-09 22:45:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 271 states have (on average 1.2915129151291513) internal successors, (350), 295 states have internal predecessors, (350), 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-01-09 22:45:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 350 transitions. [2025-01-09 22:45:55,940 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 350 transitions. Word has length 57 [2025-01-09 22:45:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:55,940 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 350 transitions. [2025-01-09 22:45:55,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-01-09 22:45:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 350 transitions. [2025-01-09 22:45:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:45:55,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:55,941 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:55,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:45:55,941 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:55,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash -340326734, now seen corresponding path program 1 times [2025-01-09 22:45:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:55,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393261188] [2025-01-09 22:45:55,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:55,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:45:55,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:45:55,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:55,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 22:45:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393261188] [2025-01-09 22:45:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393261188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 22:45:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381547332] [2025-01-09 22:45:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:45:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:56,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:45:56,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:45:56,955 INFO L87 Difference]: Start difference. First operand 296 states and 350 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 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-01-09 22:45:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:57,570 INFO L93 Difference]: Finished difference Result 392 states and 468 transitions. [2025-01-09 22:45:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:45:57,570 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 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 58 [2025-01-09 22:45:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:57,572 INFO L225 Difference]: With dead ends: 392 [2025-01-09 22:45:57,572 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 22:45:57,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:45:57,573 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 107 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:57,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 928 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:45:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 22:45:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 334. [2025-01-09 22:45:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 309 states have (on average 1.307443365695793) internal successors, (404), 333 states have internal predecessors, (404), 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-01-09 22:45:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 404 transitions. [2025-01-09 22:45:57,580 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 404 transitions. Word has length 58 [2025-01-09 22:45:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:57,580 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 404 transitions. [2025-01-09 22:45:57,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 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-01-09 22:45:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 404 transitions. [2025-01-09 22:45:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:45:57,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:57,582 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:57,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:45:57,582 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:57,583 INFO L85 PathProgramCache]: Analyzing trace with hash -340326733, now seen corresponding path program 1 times [2025-01-09 22:45:57,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:57,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067431802] [2025-01-09 22:45:57,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:57,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:57,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:45:57,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:45:57,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:57,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:45:58,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067431802] [2025-01-09 22:45:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067431802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:45:58,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:45:58,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 22:45:58,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134729597] [2025-01-09 22:45:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:45:58,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:45:58,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:58,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:45:58,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:45:58,668 INFO L87 Difference]: Start difference. First operand 334 states and 404 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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-01-09 22:45:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:59,579 INFO L93 Difference]: Finished difference Result 476 states and 572 transitions. [2025-01-09 22:45:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 22:45:59,579 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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 58 [2025-01-09 22:45:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:59,581 INFO L225 Difference]: With dead ends: 476 [2025-01-09 22:45:59,581 INFO L226 Difference]: Without dead ends: 476 [2025-01-09 22:45:59,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:45:59,582 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 161 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:59,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1031 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:45:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-09 22:45:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 334. [2025-01-09 22:45:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 309 states have (on average 1.3042071197411003) internal successors, (403), 333 states have internal predecessors, (403), 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-01-09 22:45:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 403 transitions. [2025-01-09 22:45:59,589 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 403 transitions. Word has length 58 [2025-01-09 22:45:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 403 transitions. [2025-01-09 22:45:59,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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-01-09 22:45:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 403 transitions. [2025-01-09 22:45:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 22:45:59,593 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:59,593 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:59,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:45:59,593 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:45:59,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1744161372, now seen corresponding path program 1 times [2025-01-09 22:45:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228773796] [2025-01-09 22:45:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:59,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 22:45:59,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:45:59,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:59,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 22:46:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228773796] [2025-01-09 22:46:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228773796] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:46:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316901257] [2025-01-09 22:46:01,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:01,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:46:01,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:46:01,263 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:46:01,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:46:01,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 22:46:01,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:46:01,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:01,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:01,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-01-09 22:46:01,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:46:01,544 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-01-09 22:46:01,659 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:46:01,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:46:01,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:46:01,964 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 45 treesize of output 25 [2025-01-09 22:46:01,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:46:02,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:46:02,061 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 22:46:02,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 31 [2025-01-09 22:46:02,279 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-09 22:46:02,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2025-01-09 22:46:02,295 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 19 treesize of output 18 [2025-01-09 22:46:02,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:46:02,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:46:03,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:46:03,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 193 [2025-01-09 22:46:03,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:46:03,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 181 [2025-01-09 22:46:05,332 INFO L349 Elim1Store]: treesize reduction 72, result has 64.2 percent of original size [2025-01-09 22:46:05,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 152 treesize of output 234 [2025-01-09 22:46:05,414 INFO L349 Elim1Store]: treesize reduction 48, result has 60.3 percent of original size [2025-01-09 22:46:05,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 104 treesize of output 136 [2025-01-09 22:46:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 22:46:13,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:46:13,998 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 498 treesize of output 470 [2025-01-09 22:46:14,006 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 798 treesize of output 742 [2025-01-09 22:46:37,603 INFO L349 Elim1Store]: treesize reduction 32, result has 74.6 percent of original size [2025-01-09 22:46:37,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 462 treesize of output 510 [2025-01-09 22:46:39,685 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2025-01-09 22:46:39,686 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 374 treesize of output 339 [2025-01-09 22:46:40,404 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 174 treesize of output 162 [2025-01-09 22:46:40,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:46:40,637 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 195 treesize of output 185 [2025-01-09 22:46:40,873 INFO L349 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2025-01-09 22:46:40,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 395 treesize of output 394 [2025-01-09 22:46:41,631 INFO L349 Elim1Store]: treesize reduction 77, result has 70.7 percent of original size [2025-01-09 22:46:41,632 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 10 case distinctions, treesize of input 662 treesize of output 779 [2025-01-09 22:46:55,879 INFO L349 Elim1Store]: treesize reduction 45, result has 64.3 percent of original size [2025-01-09 22:46:55,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 462 treesize of output 497 [2025-01-09 22:46:59,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:46:59,411 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 195 treesize of output 185 [2025-01-09 22:46:59,531 INFO L349 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2025-01-09 22:46:59,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 395 treesize of output 394 [2025-01-09 22:46:59,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:46:59,974 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 195 treesize of output 185 [2025-01-09 22:47:00,198 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2025-01-09 22:47:00,198 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 374 treesize of output 339 [2025-01-09 22:47:00,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:47:00,867 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 195 treesize of output 185 [2025-01-09 22:47:00,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:47:00,965 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 195 treesize of output 185 [2025-01-09 22:47:01,311 INFO L349 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2025-01-09 22:47:01,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 395 treesize of output 394 [2025-01-09 22:47:01,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:47:01,837 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 195 treesize of output 185 [2025-01-09 22:47:02,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:47:02,019 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 195 treesize of output 185 [2025-01-09 22:47:02,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:47:02,172 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 195 treesize of output 185 [2025-01-09 22:47:02,405 INFO L349 Elim1Store]: treesize reduction 32, result has 74.6 percent of original size [2025-01-09 22:47:02,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 462 treesize of output 510 [2025-01-09 22:47:04,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:47:04,981 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 195 treesize of output 185 [2025-01-09 22:47:05,179 INFO L349 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2025-01-09 22:47:05,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 395 treesize of output 394 [2025-01-09 22:47:05,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:47:05,515 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 195 treesize of output 185 [2025-01-09 22:47:05,650 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 174 treesize of output 162