./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 64bit --witnessprinter.graph.data.programhash deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:26:17,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:26:17,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:26:17,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:26:17,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:26:17,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:26:17,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:26:17,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:26:17,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:26:17,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:26:17,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:26:17,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:26:17,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:26:17,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:26:17,991 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:26:17,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:26:17,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:26:17,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:26:17,992 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:26:17,992 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:26:17,992 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:26:17,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:26:17,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:26:17,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:26:17,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:26:17,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:26:17,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:26:17,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:26:17,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:26:17,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:26:17,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:17,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:26:17,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:26:17,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:26:17,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:26:17,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:26:17,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:26:17,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:26:17,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:26:17,994 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2025-03-09 00:26:18,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:26:18,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:26:18,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:26:18,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:26:18,242 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:26:18,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-03-09 00:26:19,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe977b46c/642d6c959955446bab70c6694c05187f/FLAG671f9adf2 [2025-03-09 00:26:19,663 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:26:19,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-03-09 00:26:19,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe977b46c/642d6c959955446bab70c6694c05187f/FLAG671f9adf2 [2025-03-09 00:26:19,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe977b46c/642d6c959955446bab70c6694c05187f [2025-03-09 00:26:19,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:26:19,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:26:19,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:19,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:26:19,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:26:19,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:19" (1/1) ... [2025-03-09 00:26:19,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2756f340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:19, skipping insertion in model container [2025-03-09 00:26:19,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:19" (1/1) ... [2025-03-09 00:26:19,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:26:20,263 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:20,273 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:20,275 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:20,281 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:20,296 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:20,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:20,324 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:26:20,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:20,459 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:26:20,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20 WrapperNode [2025-03-09 00:26:20,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:20,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:20,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:26:20,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:26:20,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,534 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 648 [2025-03-09 00:26:20,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:20,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:26:20,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:26:20,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:26:20,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,580 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 3, 3, 4, 4, 4, 4, 2, 3, 44, 355, 2, 6, 11]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 0, 3, 42, 355, 0, 0, 0]. The 9 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 1, 2, 2]. [2025-03-09 00:26:20,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:26:20,612 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:26:20,612 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:26:20,612 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:26:20,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (1/1) ... [2025-03-09 00:26:20,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:20,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:20,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:26:20,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:26:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:26:20,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:26:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:26:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 00:26:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 00:26:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 00:26:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 00:26:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 00:26:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 00:26:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 00:26:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 00:26:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-09 00:26:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 00:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 00:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 00:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-09 00:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-09 00:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:26:20,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:26:20,841 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:26:20,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:26:21,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: havoc single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset; [2025-03-09 00:26:21,402 INFO L? ?]: Removed 163 outVars from TransFormulas that were not future-live. [2025-03-09 00:26:21,402 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:26:21,415 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:26:21,416 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:26:21,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:21 BoogieIcfgContainer [2025-03-09 00:26:21,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:26:21,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:26:21,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:26:21,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:26:21,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:26:19" (1/3) ... [2025-03-09 00:26:21,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192b19be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:21, skipping insertion in model container [2025-03-09 00:26:21,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:20" (2/3) ... [2025-03-09 00:26:21,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192b19be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:21, skipping insertion in model container [2025-03-09 00:26:21,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:21" (3/3) ... [2025-03-09 00:26:21,426 INFO L128 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2025-03-09 00:26:21,436 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:26:21,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dirname-1.i that has 2 procedures, 176 locations, 1 initial locations, 6 loop locations, and 74 error locations. [2025-03-09 00:26:21,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:26:21,479 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;@592c8a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:26:21,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-09 00:26:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 99 states have (on average 1.9494949494949494) internal successors, (193), 173 states have internal predecessors, (193), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:21,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:21,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:21,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:21,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash 227364, now seen corresponding path program 1 times [2025-03-09 00:26:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:21,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753591724] [2025-03-09 00:26:21,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:21,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:21,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:21,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:21,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:21,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753591724] [2025-03-09 00:26:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753591724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:21,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:21,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207330142] [2025-03-09 00:26:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:21,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:21,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:21,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:21,922 INFO L87 Difference]: Start difference. First operand has 176 states, 99 states have (on average 1.9494949494949494) internal successors, (193), 173 states have internal predecessors, (193), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:22,051 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2025-03-09 00:26:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:22,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-09 00:26:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:22,058 INFO L225 Difference]: With dead ends: 136 [2025-03-09 00:26:22,059 INFO L226 Difference]: Without dead ends: 136 [2025-03-09 00:26:22,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:22,064 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 139 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:22,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 94 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-09 00:26:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-09 00:26:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 133 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2025-03-09 00:26:22,100 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 3 [2025-03-09 00:26:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:22,100 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2025-03-09 00:26:22,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2025-03-09 00:26:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:22,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:22,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:22,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:26:22,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:22,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:22,101 INFO L85 PathProgramCache]: Analyzing trace with hash 227365, now seen corresponding path program 1 times [2025-03-09 00:26:22,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:22,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087901356] [2025-03-09 00:26:22,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:22,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:22,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:22,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:22,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:22,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:22,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087901356] [2025-03-09 00:26:22,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087901356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:22,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:22,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:22,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962266604] [2025-03-09 00:26:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:22,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:22,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:22,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:22,304 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:22,400 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-03-09 00:26:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:22,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-09 00:26:22,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:22,401 INFO L225 Difference]: With dead ends: 135 [2025-03-09 00:26:22,402 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 00:26:22,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:22,403 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:22,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 228 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 00:26:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-09 00:26:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 79 states have (on average 1.860759493670886) internal successors, (147), 132 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2025-03-09 00:26:22,414 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 3 [2025-03-09 00:26:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:22,414 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2025-03-09 00:26:22,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2025-03-09 00:26:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:26:22,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:22,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:26:22,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:26:22,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:22,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1816370850, now seen corresponding path program 1 times [2025-03-09 00:26:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:22,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625309008] [2025-03-09 00:26:22,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:22,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:26:22,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:26:22,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:22,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:22,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:22,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625309008] [2025-03-09 00:26:22,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625309008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:22,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:22,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245263847] [2025-03-09 00:26:22,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:22,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:22,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:22,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:22,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:22,676 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:22,777 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2025-03-09 00:26:22,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:22,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-03-09 00:26:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:22,778 INFO L225 Difference]: With dead ends: 138 [2025-03-09 00:26:22,778 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 00:26:22,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:22,779 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 7 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:22,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 226 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 00:26:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-03-09 00:26:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 81 states have (on average 1.8395061728395061) internal successors, (149), 134 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2025-03-09 00:26:22,793 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 6 [2025-03-09 00:26:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:22,794 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2025-03-09 00:26:22,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2025-03-09 00:26:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:26:22,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:22,794 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:22,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:26:22,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:22,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash 789098176, now seen corresponding path program 1 times [2025-03-09 00:26:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:22,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163645610] [2025-03-09 00:26:22,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:22,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:22,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:26:22,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:26:22,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:22,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163645610] [2025-03-09 00:26:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163645610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:23,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613963007] [2025-03-09 00:26:23,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:23,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:23,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:23,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:23,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:26:23,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:26:23,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:26:23,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:23,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:23,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:26:23,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:23,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:23,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-09 00:26:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:23,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613963007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:23,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:23,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:26:23,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984615903] [2025-03-09 00:26:23,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:23,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:26:23,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:23,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:26:23,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:26:23,507 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:23,757 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2025-03-09 00:26:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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 9 [2025-03-09 00:26:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:23,758 INFO L225 Difference]: With dead ends: 141 [2025-03-09 00:26:23,758 INFO L226 Difference]: Without dead ends: 141 [2025-03-09 00:26:23,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:26:23,759 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 283 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:23,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 642 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-09 00:26:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-09 00:26:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 138 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2025-03-09 00:26:23,764 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 9 [2025-03-09 00:26:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:23,764 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2025-03-09 00:26:23,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2025-03-09 00:26:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 00:26:23,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:23,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:23,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:26:23,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:23,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:23,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:23,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2146038354, now seen corresponding path program 1 times [2025-03-09 00:26:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:23,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208464002] [2025-03-09 00:26:23,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:23,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:26:24,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:26:24,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:24,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:24,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:24,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208464002] [2025-03-09 00:26:24,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208464002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:24,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913379301] [2025-03-09 00:26:24,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:24,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:24,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:24,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:24,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:26:24,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:26:24,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:26:24,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:24,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:24,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:26:24,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:24,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:24,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913379301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:24,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:24,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 00:26:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554915148] [2025-03-09 00:26:24,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:24,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:26:24,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:24,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:26:24,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:26:24,449 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:24,481 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2025-03-09 00:26:24,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:26:24,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-09 00:26:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:24,482 INFO L225 Difference]: With dead ends: 156 [2025-03-09 00:26:24,483 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 00:26:24,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:26:24,483 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 4 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:24,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 571 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 00:26:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-09 00:26:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.6633663366336633) internal successors, (168), 153 states have internal predecessors, (168), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2025-03-09 00:26:24,490 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 21 [2025-03-09 00:26:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:24,490 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2025-03-09 00:26:24,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2025-03-09 00:26:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:26:24,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:24,491 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:24,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:26:24,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:24,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:24,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:24,692 INFO L85 PathProgramCache]: Analyzing trace with hash 965205552, now seen corresponding path program 2 times [2025-03-09 00:26:24,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:24,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296088389] [2025-03-09 00:26:24,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:24,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:26:24,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 36 statements. [2025-03-09 00:26:24,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:26:24,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-09 00:26:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296088389] [2025-03-09 00:26:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296088389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:24,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:24,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:24,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990464461] [2025-03-09 00:26:24,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:24,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:24,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:24,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:24,820 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:24,890 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2025-03-09 00:26:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-09 00:26:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:24,892 INFO L225 Difference]: With dead ends: 151 [2025-03-09 00:26:24,892 INFO L226 Difference]: Without dead ends: 151 [2025-03-09 00:26:24,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:24,892 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:24,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 98 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-09 00:26:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-09 00:26:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.613861386138614) internal successors, (163), 148 states have internal predecessors, (163), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2025-03-09 00:26:24,896 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 36 [2025-03-09 00:26:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:24,896 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2025-03-09 00:26:24,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2025-03-09 00:26:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:26:24,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:24,897 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:24,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:26:24,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:24,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash 965205553, now seen corresponding path program 1 times [2025-03-09 00:26:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:24,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255235771] [2025-03-09 00:26:24,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:24,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 00:26:24,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:26:24,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:24,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:25,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:25,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255235771] [2025-03-09 00:26:25,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255235771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:25,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204708861] [2025-03-09 00:26:25,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:25,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:25,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:25,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:25,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:26:25,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 00:26:25,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:26:25,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:25,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:25,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:26:25,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:25,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:25,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204708861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:25,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:25,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-09 00:26:25,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669180749] [2025-03-09 00:26:25,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:25,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:26:25,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:25,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:26:25,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:25,502 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:25,543 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2025-03-09 00:26:25,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:25,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-09 00:26:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:25,544 INFO L225 Difference]: With dead ends: 157 [2025-03-09 00:26:25,544 INFO L226 Difference]: Without dead ends: 157 [2025-03-09 00:26:25,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:25,545 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:25,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 551 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-09 00:26:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-09 00:26:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 107 states have (on average 1.5794392523364487) internal successors, (169), 154 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-03-09 00:26:25,549 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 36 [2025-03-09 00:26:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:25,549 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-03-09 00:26:25,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-03-09 00:26:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 00:26:25,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:25,550 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:25,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:26:25,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:25,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:25,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:25,751 INFO L85 PathProgramCache]: Analyzing trace with hash -7963919, now seen corresponding path program 2 times [2025-03-09 00:26:25,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:25,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046042611] [2025-03-09 00:26:25,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:25,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:25,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 00:26:25,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-09 00:26:25,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:26:25,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046042611] [2025-03-09 00:26:26,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046042611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:26,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:26,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:26:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344321210] [2025-03-09 00:26:26,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:26,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:26,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:26,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:26,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:26,113 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:26,263 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2025-03-09 00:26:26,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:26:26,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-03-09 00:26:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:26,265 INFO L225 Difference]: With dead ends: 246 [2025-03-09 00:26:26,265 INFO L226 Difference]: Without dead ends: 246 [2025-03-09 00:26:26,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:26,265 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 333 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:26,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 387 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-09 00:26:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 156. [2025-03-09 00:26:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 107 states have (on average 1.5700934579439252) internal successors, (168), 153 states have internal predecessors, (168), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2025-03-09 00:26:26,278 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 42 [2025-03-09 00:26:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:26,278 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2025-03-09 00:26:26,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2025-03-09 00:26:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:26:26,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:26,279 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:26,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:26:26,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:26,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1029788538, now seen corresponding path program 1 times [2025-03-09 00:26:26,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128571618] [2025-03-09 00:26:26,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:26,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:26,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:26:26,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:26:26,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:26,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:26,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:26,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128571618] [2025-03-09 00:26:26,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128571618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:26,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:26,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:26:26,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464044070] [2025-03-09 00:26:26,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:26,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:26,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:26,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:26,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:26,590 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:26,767 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2025-03-09 00:26:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:26,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-09 00:26:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:26,769 INFO L225 Difference]: With dead ends: 175 [2025-03-09 00:26:26,769 INFO L226 Difference]: Without dead ends: 175 [2025-03-09 00:26:26,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:26,769 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 178 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:26,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 185 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-09 00:26:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2025-03-09 00:26:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 121 states have (on average 1.5702479338842976) internal successors, (190), 167 states have internal predecessors, (190), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2025-03-09 00:26:26,773 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 45 [2025-03-09 00:26:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:26,774 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2025-03-09 00:26:26,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2025-03-09 00:26:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:26:26,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:26,775 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:26,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:26:26,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:26,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1029789467, now seen corresponding path program 1 times [2025-03-09 00:26:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:26,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549580353] [2025-03-09 00:26:26,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:26,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:26,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:26:26,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:26:26,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:26,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:26,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:26,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549580353] [2025-03-09 00:26:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549580353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:26,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863306435] [2025-03-09 00:26:26,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:26,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:26,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:26,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:26,922 INFO L87 Difference]: Start difference. First operand 170 states and 192 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:27,009 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2025-03-09 00:26:27,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:27,010 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-09 00:26:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:27,010 INFO L225 Difference]: With dead ends: 164 [2025-03-09 00:26:27,010 INFO L226 Difference]: Without dead ends: 164 [2025-03-09 00:26:27,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-09 00:26:27,011 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 187 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:27,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 120 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:27,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-09 00:26:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-09 00:26:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.5206611570247934) internal successors, (184), 161 states have internal predecessors, (184), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2025-03-09 00:26:27,014 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 45 [2025-03-09 00:26:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:27,014 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2025-03-09 00:26:27,014 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2025-03-09 00:26:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:26:27,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:27,015 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:27,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:26:27,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:27,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1029789466, now seen corresponding path program 1 times [2025-03-09 00:26:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:27,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863005625] [2025-03-09 00:26:27,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:27,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:27,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:26:27,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:26:27,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:27,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863005625] [2025-03-09 00:26:27,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863005625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:27,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:27,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:26:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46752772] [2025-03-09 00:26:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:27,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:27,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:27,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:27,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:27,236 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:27,284 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2025-03-09 00:26:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:27,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-09 00:26:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:27,286 INFO L225 Difference]: With dead ends: 169 [2025-03-09 00:26:27,286 INFO L226 Difference]: Without dead ends: 169 [2025-03-09 00:26:27,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:27,287 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 160 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:27,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 480 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-09 00:26:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2025-03-09 00:26:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.512396694214876) internal successors, (183), 161 states have internal predecessors, (183), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 185 transitions. [2025-03-09 00:26:27,291 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 185 transitions. Word has length 45 [2025-03-09 00:26:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:27,291 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 185 transitions. [2025-03-09 00:26:27,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 185 transitions. [2025-03-09 00:26:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:26:27,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:27,292 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:27,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:26:27,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:27,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash 521175851, now seen corresponding path program 1 times [2025-03-09 00:26:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:27,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104158962] [2025-03-09 00:26:27,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:27,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:27,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:26:27,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:26:27,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:27,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104158962] [2025-03-09 00:26:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104158962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689668684] [2025-03-09 00:26:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:27,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:27,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:27,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:27,460 INFO L87 Difference]: Start difference. First operand 164 states and 185 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:27,516 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2025-03-09 00:26:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:27,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-09 00:26:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:27,517 INFO L225 Difference]: With dead ends: 163 [2025-03-09 00:26:27,517 INFO L226 Difference]: Without dead ends: 163 [2025-03-09 00:26:27,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:27,518 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 114 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:27,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 102 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-09 00:26:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-09 00:26:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 121 states have (on average 1.4958677685950412) internal successors, (181), 160 states have internal predecessors, (181), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 183 transitions. [2025-03-09 00:26:27,521 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 183 transitions. Word has length 48 [2025-03-09 00:26:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:27,521 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 183 transitions. [2025-03-09 00:26:27,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 183 transitions. [2025-03-09 00:26:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:26:27,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:27,522 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:27,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:26:27,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:27,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:27,522 INFO L85 PathProgramCache]: Analyzing trace with hash 521175852, now seen corresponding path program 1 times [2025-03-09 00:26:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:27,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844784389] [2025-03-09 00:26:27,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:27,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:27,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:26:27,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:26:27,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:27,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:28,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844784389] [2025-03-09 00:26:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844784389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:28,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:28,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:26:28,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768259779] [2025-03-09 00:26:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:28,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:26:28,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:28,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:26:28,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:28,029 INFO L87 Difference]: Start difference. First operand 163 states and 183 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:28,262 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2025-03-09 00:26:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:26:28,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-09 00:26:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:28,263 INFO L225 Difference]: With dead ends: 167 [2025-03-09 00:26:28,263 INFO L226 Difference]: Without dead ends: 167 [2025-03-09 00:26:28,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:28,264 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 15 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:28,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 463 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-09 00:26:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2025-03-09 00:26:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 121 states have (on average 1.487603305785124) internal successors, (180), 160 states have internal predecessors, (180), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 182 transitions. [2025-03-09 00:26:28,270 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 182 transitions. Word has length 48 [2025-03-09 00:26:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:28,271 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 182 transitions. [2025-03-09 00:26:28,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 182 transitions. [2025-03-09 00:26:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:26:28,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:28,271 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:28,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:26:28,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:28,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 43141022, now seen corresponding path program 1 times [2025-03-09 00:26:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:28,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867271307] [2025-03-09 00:26:28,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:28,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:26:28,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:26:28,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:28,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:28,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:28,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867271307] [2025-03-09 00:26:28,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867271307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:28,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:28,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:28,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981668805] [2025-03-09 00:26:28,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:28,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:28,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:28,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:28,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:28,484 INFO L87 Difference]: Start difference. First operand 163 states and 182 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:28,603 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2025-03-09 00:26:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:28,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 00:26:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:28,604 INFO L225 Difference]: With dead ends: 162 [2025-03-09 00:26:28,604 INFO L226 Difference]: Without dead ends: 162 [2025-03-09 00:26:28,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:28,604 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 12 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:28,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 356 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-09 00:26:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-09 00:26:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 121 states have (on average 1.4710743801652892) internal successors, (178), 159 states have internal predecessors, (178), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 180 transitions. [2025-03-09 00:26:28,609 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 180 transitions. Word has length 51 [2025-03-09 00:26:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:28,609 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 180 transitions. [2025-03-09 00:26:28,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 180 transitions. [2025-03-09 00:26:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:26:28,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:28,611 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:28,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:26:28,611 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 43141023, now seen corresponding path program 1 times [2025-03-09 00:26:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:28,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853443361] [2025-03-09 00:26:28,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:28,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:28,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:26:28,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:26:28,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:28,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:28,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:28,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853443361] [2025-03-09 00:26:28,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853443361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:28,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:28,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:28,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459624603] [2025-03-09 00:26:28,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:28,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:28,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:28,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:28,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:28,981 INFO L87 Difference]: Start difference. First operand 162 states and 180 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:29,111 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2025-03-09 00:26:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 00:26:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:29,112 INFO L225 Difference]: With dead ends: 161 [2025-03-09 00:26:29,112 INFO L226 Difference]: Without dead ends: 161 [2025-03-09 00:26:29,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:29,113 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 11 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:29,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 336 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-09 00:26:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-09 00:26:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 158 states have internal predecessors, (176), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 178 transitions. [2025-03-09 00:26:29,119 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 178 transitions. Word has length 51 [2025-03-09 00:26:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:29,119 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 178 transitions. [2025-03-09 00:26:29,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 178 transitions. [2025-03-09 00:26:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 00:26:29,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:29,120 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:29,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:26:29,120 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:29,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1527226002, now seen corresponding path program 1 times [2025-03-09 00:26:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:29,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554738053] [2025-03-09 00:26:29,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:29,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:29,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 00:26:29,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 00:26:29,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:29,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:29,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:29,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554738053] [2025-03-09 00:26:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554738053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:29,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606717552] [2025-03-09 00:26:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:29,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:29,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:29,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:29,221 INFO L87 Difference]: Start difference. First operand 161 states and 178 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:29,232 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2025-03-09 00:26:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:29,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 00:26:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:29,234 INFO L225 Difference]: With dead ends: 173 [2025-03-09 00:26:29,234 INFO L226 Difference]: Without dead ends: 173 [2025-03-09 00:26:29,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:29,234 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:29,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 255 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-09 00:26:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2025-03-09 00:26:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 160 states have internal predecessors, (178), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2025-03-09 00:26:29,240 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 55 [2025-03-09 00:26:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:29,241 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2025-03-09 00:26:29,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2025-03-09 00:26:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 00:26:29,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:29,242 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:29,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:26:29,242 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:29,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash 99612257, now seen corresponding path program 1 times [2025-03-09 00:26:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966700563] [2025-03-09 00:26:29,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:29,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 00:26:29,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 00:26:29,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:29,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:29,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966700563] [2025-03-09 00:26:29,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966700563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:29,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:29,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493233737] [2025-03-09 00:26:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:29,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:29,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:29,381 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:29,478 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2025-03-09 00:26:29,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:29,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 00:26:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:29,479 INFO L225 Difference]: With dead ends: 162 [2025-03-09 00:26:29,479 INFO L226 Difference]: Without dead ends: 162 [2025-03-09 00:26:29,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:29,480 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 5 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:29,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 390 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-09 00:26:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-09 00:26:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 159 states have internal predecessors, (176), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2025-03-09 00:26:29,487 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 56 [2025-03-09 00:26:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:29,487 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2025-03-09 00:26:29,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2025-03-09 00:26:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 00:26:29,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:29,487 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:29,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:26:29,488 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:29,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash 99612258, now seen corresponding path program 1 times [2025-03-09 00:26:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:29,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767923442] [2025-03-09 00:26:29,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:29,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:29,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 00:26:29,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 00:26:29,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:29,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:30,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767923442] [2025-03-09 00:26:30,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767923442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:30,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:30,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:26:30,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46627262] [2025-03-09 00:26:30,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:30,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:30,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:30,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:30,030 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:30,175 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2025-03-09 00:26:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:26:30,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 00:26:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:30,177 INFO L225 Difference]: With dead ends: 170 [2025-03-09 00:26:30,177 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 00:26:30,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:30,177 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 14 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:30,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 333 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 00:26:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2025-03-09 00:26:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.4186046511627908) internal successors, (183), 165 states have internal predecessors, (183), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2025-03-09 00:26:30,183 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 56 [2025-03-09 00:26:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:30,183 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2025-03-09 00:26:30,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2025-03-09 00:26:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 00:26:30,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:30,184 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-09 00:26:30,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:26:30,184 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:30,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 110500990, now seen corresponding path program 1 times [2025-03-09 00:26:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:30,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741647155] [2025-03-09 00:26:30,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:30,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:26:30,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:26:30,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:30,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:30,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:30,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741647155] [2025-03-09 00:26:30,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741647155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:30,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137720731] [2025-03-09 00:26:30,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:30,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:30,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:30,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:30,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:26:30,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:26:30,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:26:30,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:30,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:30,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:26:30,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:30,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:30,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137720731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:30,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:30,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:26:30,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082355638] [2025-03-09 00:26:30,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:30,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:30,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:30,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:30,604 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:30,626 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2025-03-09 00:26:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:30,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2025-03-09 00:26:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:30,628 INFO L225 Difference]: With dead ends: 195 [2025-03-09 00:26:30,628 INFO L226 Difference]: Without dead ends: 195 [2025-03-09 00:26:30,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:30,628 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 13 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:30,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 625 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-09 00:26:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2025-03-09 00:26:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.392156862745098) internal successors, (213), 189 states have internal predecessors, (213), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 215 transitions. [2025-03-09 00:26:30,633 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 215 transitions. Word has length 60 [2025-03-09 00:26:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:30,633 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 215 transitions. [2025-03-09 00:26:30,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 215 transitions. [2025-03-09 00:26:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 00:26:30,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:30,634 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 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] [2025-03-09 00:26:30,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:30,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:30,835 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:30,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash -869190154, now seen corresponding path program 1 times [2025-03-09 00:26:30,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:30,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764585135] [2025-03-09 00:26:30,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:30,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:30,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:26:30,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:26:30,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:30,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:31,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764585135] [2025-03-09 00:26:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764585135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:31,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520406922] [2025-03-09 00:26:31,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:31,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:31,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:31,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:31,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:26:31,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:26:31,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:26:31,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:31,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:31,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 00:26:31,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:31,636 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-03-09 00:26:31,652 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 23 treesize of output 1 [2025-03-09 00:26:31,654 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 23 treesize of output 1 [2025-03-09 00:26:31,790 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 25 treesize of output 9 [2025-03-09 00:26:31,794 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 36 treesize of output 12 [2025-03-09 00:26:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:31,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:32,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520406922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:32,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:32,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-09 00:26:32,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126453787] [2025-03-09 00:26:32,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:32,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:26:32,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:32,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:26:32,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-03-09 00:26:32,010 INFO L87 Difference]: Start difference. First operand 192 states and 215 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:32,431 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2025-03-09 00:26:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:32,431 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2025-03-09 00:26:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:32,432 INFO L225 Difference]: With dead ends: 191 [2025-03-09 00:26:32,432 INFO L226 Difference]: Without dead ends: 191 [2025-03-09 00:26:32,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:26:32,433 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 32 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:32,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 824 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-09 00:26:32,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-09 00:26:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 188 states have internal predecessors, (207), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 209 transitions. [2025-03-09 00:26:32,437 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 209 transitions. Word has length 61 [2025-03-09 00:26:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:32,437 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 209 transitions. [2025-03-09 00:26:32,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2025-03-09 00:26:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 00:26:32,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:32,438 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:32,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:26:32,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:32,642 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:32,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1995498898, now seen corresponding path program 2 times [2025-03-09 00:26:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923505362] [2025-03-09 00:26:32,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:32,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-09 00:26:32,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 00:26:32,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:26:32,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:32,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923505362] [2025-03-09 00:26:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923505362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:32,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323020887] [2025-03-09 00:26:32,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:32,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:32,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:32,823 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:32,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:26:32,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-09 00:26:33,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 00:26:33,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:26:33,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:33,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:26:33,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:33,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:33,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323020887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:33,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:33,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:26:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746215443] [2025-03-09 00:26:33,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:33,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:26:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:33,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:26:33,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:33,222 INFO L87 Difference]: Start difference. First operand 191 states and 209 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:33,260 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2025-03-09 00:26:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:33,260 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2025-03-09 00:26:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:33,261 INFO L225 Difference]: With dead ends: 260 [2025-03-09 00:26:33,261 INFO L226 Difference]: Without dead ends: 260 [2025-03-09 00:26:33,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:33,262 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 29 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:33,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 521 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-09 00:26:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2025-03-09 00:26:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 213 states have (on average 1.2816901408450705) internal successors, (273), 248 states have internal predecessors, (273), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 275 transitions. [2025-03-09 00:26:33,267 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 275 transitions. Word has length 75 [2025-03-09 00:26:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:33,267 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 275 transitions. [2025-03-09 00:26:33,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 275 transitions. [2025-03-09 00:26:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 00:26:33,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:33,268 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:33,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:33,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:33,469 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:33,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:33,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1815412754, now seen corresponding path program 3 times [2025-03-09 00:26:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:33,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415200125] [2025-03-09 00:26:33,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:26:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:33,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-03-09 00:26:33,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-03-09 00:26:33,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:26:33,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415200125] [2025-03-09 00:26:33,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415200125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226700658] [2025-03-09 00:26:33,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:26:33,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:33,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:33,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:33,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:26:34,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-03-09 00:26:34,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-03-09 00:26:34,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:26:34,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:34,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 00:26:34,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:34,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:34,295 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 19 treesize of output 14 [2025-03-09 00:26:34,305 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:34,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:34,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:34,690 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 19 treesize of output 14 [2025-03-09 00:26:34,697 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:34,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:34,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:35,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:26:35,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 72 [2025-03-09 00:26:35,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2025-03-09 00:26:35,878 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:26:35,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 59 [2025-03-09 00:26:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:35,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226700658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:35,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:35,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2025-03-09 00:26:35,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140743681] [2025-03-09 00:26:35,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:35,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 00:26:35,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:35,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 00:26:35,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:26:35,912 INFO L87 Difference]: Start difference. First operand 251 states and 275 transitions. Second operand has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:36,340 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2025-03-09 00:26:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:26:36,340 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-03-09 00:26:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:36,341 INFO L225 Difference]: With dead ends: 247 [2025-03-09 00:26:36,341 INFO L226 Difference]: Without dead ends: 247 [2025-03-09 00:26:36,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:26:36,344 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 367 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:36,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 519 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-09 00:26:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 192. [2025-03-09 00:26:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 189 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2025-03-09 00:26:36,349 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 105 [2025-03-09 00:26:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:36,350 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2025-03-09 00:26:36,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2025-03-09 00:26:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 00:26:36,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:36,351 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:36,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:26:36,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:36,552 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:36,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1815411826, now seen corresponding path program 1 times [2025-03-09 00:26:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:36,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753907309] [2025-03-09 00:26:36,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:36,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:36,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:26:36,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:26:36,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:36,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:37,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753907309] [2025-03-09 00:26:37,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753907309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252465852] [2025-03-09 00:26:37,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:37,064 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:37,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:26:37,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:26:37,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:26:37,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:37,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:37,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 00:26:37,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:37,504 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:37,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:37,510 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 19 treesize of output 14 [2025-03-09 00:26:37,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 00:26:37,750 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 12 treesize of output 4 [2025-03-09 00:26:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2025-03-09 00:26:37,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:38,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2025-03-09 00:26:38,082 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:26:38,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 49 [2025-03-09 00:26:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:38,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252465852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:38,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:38,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 19 [2025-03-09 00:26:38,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879478241] [2025-03-09 00:26:38,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:38,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:26:38,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:38,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:26:38,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-09 00:26:38,110 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:38,488 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2025-03-09 00:26:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:26:38,488 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2025-03-09 00:26:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:38,489 INFO L225 Difference]: With dead ends: 252 [2025-03-09 00:26:38,489 INFO L226 Difference]: Without dead ends: 252 [2025-03-09 00:26:38,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:26:38,491 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 701 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:38,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 408 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-09 00:26:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 191. [2025-03-09 00:26:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 161 states have (on average 1.2608695652173914) internal successors, (203), 188 states have internal predecessors, (203), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2025-03-09 00:26:38,496 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 105 [2025-03-09 00:26:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:38,496 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2025-03-09 00:26:38,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2025-03-09 00:26:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 00:26:38,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:38,497 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:38,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:38,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 00:26:38,699 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:38,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash 733279264, now seen corresponding path program 1 times [2025-03-09 00:26:38,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:38,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169473533] [2025-03-09 00:26:38,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:38,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:38,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 00:26:38,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 00:26:38,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:38,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169473533] [2025-03-09 00:26:39,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169473533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844607662] [2025-03-09 00:26:39,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:39,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:39,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:39,450 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:39,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:26:39,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 00:26:39,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 00:26:39,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:39,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:39,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:26:39,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:39,846 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-09 00:26:39,849 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 1 case distinctions, treesize of input 21 treesize of output 23 [2025-03-09 00:26:39,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:26:39,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-03-09 00:26:39,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:39,932 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 26 treesize of output 21 [2025-03-09 00:26:39,941 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:39,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:40,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:40,583 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 32 treesize of output 25 [2025-03-09 00:26:40,590 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:40,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:40,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:41,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:26:41,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 61 [2025-03-09 00:26:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844607662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:41,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:41,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-09 00:26:41,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781156020] [2025-03-09 00:26:41,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:41,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:26:41,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:41,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:26:41,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:26:41,690 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:42,134 INFO L93 Difference]: Finished difference Result 305 states and 322 transitions. [2025-03-09 00:26:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:26:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2025-03-09 00:26:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:42,136 INFO L225 Difference]: With dead ends: 305 [2025-03-09 00:26:42,136 INFO L226 Difference]: Without dead ends: 305 [2025-03-09 00:26:42,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:26:42,137 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 317 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:42,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 479 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-09 00:26:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 186. [2025-03-09 00:26:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 183 states have internal predecessors, (198), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions. [2025-03-09 00:26:42,141 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 108 [2025-03-09 00:26:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:42,141 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions. [2025-03-09 00:26:42,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions. [2025-03-09 00:26:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 00:26:42,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:42,142 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:42,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:26:42,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 00:26:42,343 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:42,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:42,343 INFO L85 PathProgramCache]: Analyzing trace with hash -521169184, now seen corresponding path program 1 times [2025-03-09 00:26:42,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:42,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897579226] [2025-03-09 00:26:42,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:42,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 00:26:42,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 00:26:42,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:42,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:42,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897579226] [2025-03-09 00:26:42,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897579226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:42,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:26:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769962447] [2025-03-09 00:26:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:42,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:42,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:42,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:42,555 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:42,593 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2025-03-09 00:26:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:42,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-03-09 00:26:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:42,595 INFO L225 Difference]: With dead ends: 192 [2025-03-09 00:26:42,595 INFO L226 Difference]: Without dead ends: 192 [2025-03-09 00:26:42,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:42,596 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:42,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 438 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-09 00:26:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2025-03-09 00:26:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 160 states have (on average 1.25625) internal successors, (201), 186 states have internal predecessors, (201), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions. [2025-03-09 00:26:42,600 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 110 [2025-03-09 00:26:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:42,600 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions. [2025-03-09 00:26:42,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions. [2025-03-09 00:26:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 00:26:42,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:42,601 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:42,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 00:26:42,602 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:42,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1414370313, now seen corresponding path program 1 times [2025-03-09 00:26:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:42,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130436017] [2025-03-09 00:26:42,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:42,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-09 00:26:42,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 00:26:42,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:42,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:44,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:44,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130436017] [2025-03-09 00:26:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130436017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:44,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658382020] [2025-03-09 00:26:44,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:44,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:44,036 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:44,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:26:44,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-09 00:26:44,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 00:26:44,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:44,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:44,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-09 00:26:44,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:44,427 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 11 [2025-03-09 00:26:44,430 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 11 [2025-03-09 00:26:44,480 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-03-09 00:26:44,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-09 00:26:44,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:44,486 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 27 treesize of output 15 [2025-03-09 00:26:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:44,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658382020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:45,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:45,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-03-09 00:26:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033912852] [2025-03-09 00:26:45,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:45,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:26:45,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:45,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:26:45,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-09 00:26:45,262 INFO L87 Difference]: Start difference. First operand 189 states and 203 transitions. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:45,668 INFO L93 Difference]: Finished difference Result 272 states and 289 transitions. [2025-03-09 00:26:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:26:45,668 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2025-03-09 00:26:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:45,670 INFO L225 Difference]: With dead ends: 272 [2025-03-09 00:26:45,670 INFO L226 Difference]: Without dead ends: 272 [2025-03-09 00:26:45,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:26:45,671 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 218 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:45,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1293 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-09 00:26:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2025-03-09 00:26:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 222 states have (on average 1.1936936936936937) internal successors, (265), 248 states have internal predecessors, (265), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 267 transitions. [2025-03-09 00:26:45,680 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 267 transitions. Word has length 112 [2025-03-09 00:26:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:45,680 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 267 transitions. [2025-03-09 00:26:45,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 267 transitions. [2025-03-09 00:26:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-09 00:26:45,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:45,681 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:45,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 00:26:45,882 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:45,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1007751529, now seen corresponding path program 1 times [2025-03-09 00:26:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:45,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669149772] [2025-03-09 00:26:45,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:45,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 00:26:45,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 00:26:45,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:45,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669149772] [2025-03-09 00:26:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669149772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:45,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:45,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291756579] [2025-03-09 00:26:45,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:45,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:45,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:45,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:45,995 INFO L87 Difference]: Start difference. First operand 251 states and 267 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:46,004 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2025-03-09 00:26:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-03-09 00:26:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:46,006 INFO L225 Difference]: With dead ends: 255 [2025-03-09 00:26:46,006 INFO L226 Difference]: Without dead ends: 255 [2025-03-09 00:26:46,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:46,006 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 3 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:46,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 233 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-09 00:26:46,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2025-03-09 00:26:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 223 states have (on average 1.1928251121076232) internal successors, (266), 249 states have internal predecessors, (266), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 268 transitions. [2025-03-09 00:26:46,010 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 268 transitions. Word has length 115 [2025-03-09 00:26:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:46,010 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 268 transitions. [2025-03-09 00:26:46,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 268 transitions. [2025-03-09 00:26:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-09 00:26:46,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:46,011 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:46,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 00:26:46,011 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:46,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:46,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1007751370, now seen corresponding path program 1 times [2025-03-09 00:26:46,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:46,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411880589] [2025-03-09 00:26:46,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:46,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 00:26:46,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 00:26:46,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:46,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:46,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:46,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411880589] [2025-03-09 00:26:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411880589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:46,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:46,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617746181] [2025-03-09 00:26:46,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:46,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:46,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:46,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:46,237 INFO L87 Difference]: Start difference. First operand 252 states and 268 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:46,245 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2025-03-09 00:26:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:46,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-03-09 00:26:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:46,247 INFO L225 Difference]: With dead ends: 253 [2025-03-09 00:26:46,247 INFO L226 Difference]: Without dead ends: 253 [2025-03-09 00:26:46,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:46,247 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:46,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-09 00:26:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-09 00:26:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 224 states have (on average 1.1919642857142858) internal successors, (267), 250 states have internal predecessors, (267), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 269 transitions. [2025-03-09 00:26:46,251 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 269 transitions. Word has length 115 [2025-03-09 00:26:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:46,252 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 269 transitions. [2025-03-09 00:26:46,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2025-03-09 00:26:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-09 00:26:46,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:46,252 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:46,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 00:26:46,253 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:46,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1976123657, now seen corresponding path program 1 times [2025-03-09 00:26:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:46,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030589709] [2025-03-09 00:26:46,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:46,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:46,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 00:26:46,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 00:26:46,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-03-09 00:26:47,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:47,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030589709] [2025-03-09 00:26:47,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030589709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:47,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569685175] [2025-03-09 00:26:47,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:47,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:47,116 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:47,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:26:47,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 00:26:47,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 00:26:47,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:47,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:47,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 00:26:47,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:47,506 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 00:26:47,506 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-03-09 00:26:47,664 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-03-09 00:26:47,665 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 1 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 00:26:47,688 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 00:26:47,689 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-03-09 00:26:47,711 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 00:26:47,711 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 21 treesize of output 20 [2025-03-09 00:26:47,730 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 23 treesize of output 1 [2025-03-09 00:26:48,209 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 13 treesize of output 5 [2025-03-09 00:26:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 1 proven. 75 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-09 00:26:48,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569685175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:48,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2025-03-09 00:26:48,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678574825] [2025-03-09 00:26:48,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:48,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 00:26:48,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:48,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 00:26:48,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2025-03-09 00:26:48,709 INFO L87 Difference]: Start difference. First operand 253 states and 269 transitions. Second operand has 27 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 27 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 00:26:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:48,840 INFO L93 Difference]: Finished difference Result 251 states and 267 transitions. [2025-03-09 00:26:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:48,841 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 27 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2025-03-09 00:26:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:48,842 INFO L225 Difference]: With dead ends: 251 [2025-03-09 00:26:48,842 INFO L226 Difference]: Without dead ends: 251 [2025-03-09 00:26:48,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2025-03-09 00:26:48,843 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 286 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:48,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 209 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-09 00:26:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-09 00:26:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 224 states have (on average 1.1830357142857142) internal successors, (265), 248 states have internal predecessors, (265), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 267 transitions. [2025-03-09 00:26:48,847 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 267 transitions. Word has length 116 [2025-03-09 00:26:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:48,847 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 267 transitions. [2025-03-09 00:26:48,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 27 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 00:26:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 267 transitions. [2025-03-09 00:26:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-09 00:26:48,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:48,850 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:48,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 00:26:49,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 00:26:49,051 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:26:49,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1976123656, now seen corresponding path program 1 times [2025-03-09 00:26:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:49,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387515125] [2025-03-09 00:26:49,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:49,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 00:26:49,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 00:26:49,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:49,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387515125] [2025-03-09 00:26:49,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387515125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523843942] [2025-03-09 00:26:49,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:49,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:49,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:49,738 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:49,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 00:26:49,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 00:26:50,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 00:26:50,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:50,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:50,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 00:26:50,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:50,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:50,153 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-03-09 00:26:50,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:26:50,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-03-09 00:26:50,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:50,318 INFO L349 Elim1Store]: treesize reduction 98, result has 21.6 percent of original size [2025-03-09 00:26:50,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 72 [2025-03-09 00:26:50,380 INFO L349 Elim1Store]: treesize reduction 35, result has 45.3 percent of original size [2025-03-09 00:26:50,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 45 [2025-03-09 00:26:50,649 INFO L349 Elim1Store]: treesize reduction 44, result has 50.0 percent of original size [2025-03-09 00:26:50,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 101 [2025-03-09 00:26:50,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:50,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:50,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 00:26:56,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:26:56,508 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 246 treesize of output 218 [2025-03-09 00:26:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-09 00:26:59,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:00,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-03-09 00:27:00,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-03-09 00:27:00,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523843942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:00,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:27:00,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 16 [2025-03-09 00:27:00,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25982064] [2025-03-09 00:27:00,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:00,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:27:00,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:00,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:27:00,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:27:00,557 INFO L87 Difference]: Start difference. First operand 251 states and 267 transitions. Second operand has 17 states, 16 states have (on average 5.625) internal successors, (90), 17 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:02,112 INFO L93 Difference]: Finished difference Result 272 states and 288 transitions. [2025-03-09 00:27:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:27:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.625) internal successors, (90), 17 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 116 [2025-03-09 00:27:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:02,113 INFO L225 Difference]: With dead ends: 272 [2025-03-09 00:27:02,113 INFO L226 Difference]: Without dead ends: 272 [2025-03-09 00:27:02,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=305, Invalid=751, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 00:27:02,114 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 465 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:02,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 404 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:27:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-09 00:27:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2025-03-09 00:27:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 225 states have (on average 1.1777777777777778) internal successors, (265), 248 states have internal predecessors, (265), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 267 transitions. [2025-03-09 00:27:02,118 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 267 transitions. Word has length 116 [2025-03-09 00:27:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:02,118 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 267 transitions. [2025-03-09 00:27:02,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.625) internal successors, (90), 17 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 267 transitions. [2025-03-09 00:27:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-09 00:27:02,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:02,119 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:02,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 00:27:02,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:02,324 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:27:02,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash 416880571, now seen corresponding path program 1 times [2025-03-09 00:27:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:02,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326863060] [2025-03-09 00:27:02,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:02,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:02,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 00:27:02,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 00:27:02,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:02,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:03,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326863060] [2025-03-09 00:27:03,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326863060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063807415] [2025-03-09 00:27:03,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:03,362 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:03,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 00:27:03,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 00:27:03,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 00:27:03,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:03,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:03,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1689 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-09 00:27:03,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:03,749 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 00:27:03,749 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-03-09 00:27:03,752 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-03-09 00:27:03,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:03,963 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2025-03-09 00:27:03,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 23 [2025-03-09 00:27:03,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-09 00:27:03,984 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 00:27:03,984 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-03-09 00:27:03,992 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2025-03-09 00:27:03,992 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 1 [2025-03-09 00:27:04,088 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 00:27:04,088 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-03-09 00:27:04,101 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-09 00:27:04,101 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-03-09 00:27:04,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 00:27:04,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 00:27:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-09 00:27:05,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:05,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063807415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:05,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:27:05,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 27 [2025-03-09 00:27:05,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235505470] [2025-03-09 00:27:05,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:05,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 00:27:05,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:05,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 00:27:05,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1086, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 00:27:05,671 INFO L87 Difference]: Start difference. First operand 251 states and 267 transitions. Second operand has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:06,174 INFO L93 Difference]: Finished difference Result 314 states and 331 transitions. [2025-03-09 00:27:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:27:06,175 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2025-03-09 00:27:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:06,176 INFO L225 Difference]: With dead ends: 314 [2025-03-09 00:27:06,176 INFO L226 Difference]: Without dead ends: 314 [2025-03-09 00:27:06,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 00:27:06,177 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 870 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:06,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 431 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:27:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-09 00:27:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 254. [2025-03-09 00:27:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 228 states have (on average 1.1754385964912282) internal successors, (268), 251 states have internal predecessors, (268), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 270 transitions. [2025-03-09 00:27:06,180 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 270 transitions. Word has length 119 [2025-03-09 00:27:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:06,181 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 270 transitions. [2025-03-09 00:27:06,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 270 transitions. [2025-03-09 00:27:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-09 00:27:06,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:06,182 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 3, 2, 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, 1, 1, 1, 1, 1] [2025-03-09 00:27:06,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 00:27:06,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-09 00:27:06,386 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:27:06,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:06,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1756339176, now seen corresponding path program 2 times [2025-03-09 00:27:06,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:06,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45085873] [2025-03-09 00:27:06,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:06,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:06,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-09 00:27:06,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 00:27:06,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:27:06,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:07,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:07,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45085873] [2025-03-09 00:27:07,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45085873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:07,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163405688] [2025-03-09 00:27:07,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:07,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:07,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:07,195 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:07,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 00:27:07,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-09 00:27:07,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 00:27:07,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:27:07,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:07,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 1710 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-09 00:27:07,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:07,614 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 00:27:07,614 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-03-09 00:27:07,618 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-03-09 00:27:07,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:07,775 INFO L349 Elim1Store]: treesize reduction 38, result has 26.9 percent of original size [2025-03-09 00:27:07,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 33 [2025-03-09 00:27:07,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-09 00:27:07,843 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-09 00:27:07,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-03-09 00:27:07,850 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-03-09 00:27:07,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 00:27:08,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-03-09 00:27:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-09 00:27:08,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:08,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163405688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:08,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:27:08,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 22 [2025-03-09 00:27:08,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574737777] [2025-03-09 00:27:08,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:08,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 00:27:08,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:08,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 00:27:08,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-03-09 00:27:08,712 INFO L87 Difference]: Start difference. First operand 254 states and 270 transitions. Second operand has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:09,236 INFO L93 Difference]: Finished difference Result 258 states and 274 transitions. [2025-03-09 00:27:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:27:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2025-03-09 00:27:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:09,238 INFO L225 Difference]: With dead ends: 258 [2025-03-09 00:27:09,238 INFO L226 Difference]: Without dead ends: 258 [2025-03-09 00:27:09,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 00:27:09,239 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 461 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:09,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 570 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:27:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-09 00:27:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2025-03-09 00:27:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 231 states have (on average 1.173160173160173) internal successors, (271), 254 states have internal predecessors, (271), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 273 transitions. [2025-03-09 00:27:09,247 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 273 transitions. Word has length 122 [2025-03-09 00:27:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:09,247 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 273 transitions. [2025-03-09 00:27:09,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 273 transitions. [2025-03-09 00:27:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-09 00:27:09,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:09,248 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 4, 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, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:09,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 00:27:09,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:09,449 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:27:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1808802149, now seen corresponding path program 3 times [2025-03-09 00:27:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:09,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775794836] [2025-03-09 00:27:09,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:27:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:09,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 125 statements into 12 equivalence classes. [2025-03-09 00:27:09,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 125 statements. [2025-03-09 00:27:09,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:27:09,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-03-09 00:27:10,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775794836] [2025-03-09 00:27:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775794836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879349539] [2025-03-09 00:27:10,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:27:10,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:10,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:10,021 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:10,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 00:27:10,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 125 statements into 12 equivalence classes. [2025-03-09 00:27:10,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 125 statements. [2025-03-09 00:27:10,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:27:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:10,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 00:27:10,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:10,404 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 00:27:10,404 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-03-09 00:27:10,407 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-03-09 00:27:10,571 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 00:27:10,571 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-03-09 00:27:10,575 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-03-09 00:27:10,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:10,586 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2025-03-09 00:27:10,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 1 [2025-03-09 00:27:10,620 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:27:10,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:27:10,623 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-03-09 00:27:10,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 00:27:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-03-09 00:27:10,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:11,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879349539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:11,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:27:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 22 [2025-03-09 00:27:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073878824] [2025-03-09 00:27:11,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:11,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 00:27:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:11,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 00:27:11,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:27:11,219 INFO L87 Difference]: Start difference. First operand 257 states and 273 transitions. Second operand has 23 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:11,715 INFO L93 Difference]: Finished difference Result 256 states and 272 transitions. [2025-03-09 00:27:11,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:27:11,716 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2025-03-09 00:27:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:11,717 INFO L225 Difference]: With dead ends: 256 [2025-03-09 00:27:11,717 INFO L226 Difference]: Without dead ends: 256 [2025-03-09 00:27:11,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 00:27:11,718 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 425 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:11,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 632 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:27:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-09 00:27:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2025-03-09 00:27:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 230 states have (on average 1.1695652173913043) internal successors, (269), 252 states have internal predecessors, (269), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 271 transitions. [2025-03-09 00:27:11,722 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 271 transitions. Word has length 125 [2025-03-09 00:27:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:11,722 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 271 transitions. [2025-03-09 00:27:11,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 271 transitions. [2025-03-09 00:27:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-09 00:27:11,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:11,724 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:11,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 00:27:11,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:11,925 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:27:11,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1369906765, now seen corresponding path program 1 times [2025-03-09 00:27:11,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477238950] [2025-03-09 00:27:11,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:11,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:11,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-09 00:27:11,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-09 00:27:11,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:11,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:27:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477238950] [2025-03-09 00:27:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477238950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376307397] [2025-03-09 00:27:12,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:12,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:12,094 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:12,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 00:27:12,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-09 00:27:12,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-09 00:27:12,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:12,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:12,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:27:12,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:27:12,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:27:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376307397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:12,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:12,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 00:27:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327443959] [2025-03-09 00:27:12,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:12,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:27:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:12,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:27:12,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:27:12,594 INFO L87 Difference]: Start difference. First operand 255 states and 271 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:12,622 INFO L93 Difference]: Finished difference Result 270 states and 286 transitions. [2025-03-09 00:27:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:27:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2025-03-09 00:27:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:12,623 INFO L225 Difference]: With dead ends: 270 [2025-03-09 00:27:12,624 INFO L226 Difference]: Without dead ends: 270 [2025-03-09 00:27:12,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:27:12,624 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:12,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-09 00:27:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-09 00:27:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 245 states have (on average 1.1591836734693877) internal successors, (284), 267 states have internal predecessors, (284), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 286 transitions. [2025-03-09 00:27:12,629 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 286 transitions. Word has length 128 [2025-03-09 00:27:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:12,629 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 286 transitions. [2025-03-09 00:27:12,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 286 transitions. [2025-03-09 00:27:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-09 00:27:12,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:12,630 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:12,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 00:27:12,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-09 00:27:12,836 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:27:12,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1802538058, now seen corresponding path program 2 times [2025-03-09 00:27:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:12,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816154420] [2025-03-09 00:27:12,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:12,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-09 00:27:12,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-09 00:27:12,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:27:12,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:27:13,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:13,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816154420] [2025-03-09 00:27:13,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816154420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:13,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873507542] [2025-03-09 00:27:13,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:13,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:13,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:13,151 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:13,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 00:27:13,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-09 00:27:13,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-09 00:27:13,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:27:13,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:13,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:27:13,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:27:13,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:27:13,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873507542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:13,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:13,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-09 00:27:13,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31042596] [2025-03-09 00:27:13,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:13,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:27:13,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:13,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:27:13,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-09 00:27:13,722 INFO L87 Difference]: Start difference. First operand 270 states and 286 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:13,776 INFO L93 Difference]: Finished difference Result 300 states and 316 transitions. [2025-03-09 00:27:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:27:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2025-03-09 00:27:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:13,778 INFO L225 Difference]: With dead ends: 300 [2025-03-09 00:27:13,778 INFO L226 Difference]: Without dead ends: 300 [2025-03-09 00:27:13,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-09 00:27:13,778 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 4 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:13,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 563 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-09 00:27:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-03-09 00:27:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 275 states have (on average 1.1418181818181818) internal successors, (314), 297 states have internal predecessors, (314), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 316 transitions. [2025-03-09 00:27:13,783 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 316 transitions. Word has length 143 [2025-03-09 00:27:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:13,784 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 316 transitions. [2025-03-09 00:27:13,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 316 transitions. [2025-03-09 00:27:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-09 00:27:13,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:13,785 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:13,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 00:27:13,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:13,985 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:27:13,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2002074859, now seen corresponding path program 2 times [2025-03-09 00:27:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:13,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989245431] [2025-03-09 00:27:13,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:14,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 172 statements into 2 equivalence classes. [2025-03-09 00:27:14,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 172 of 172 statements. [2025-03-09 00:27:14,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:27:14,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 19 proven. 550 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-09 00:27:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:14,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989245431] [2025-03-09 00:27:14,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989245431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:14,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588261004] [2025-03-09 00:27:14,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:14,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:14,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:14,600 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:14,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 00:27:14,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 172 statements into 2 equivalence classes. [2025-03-09 00:27:15,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 172 of 172 statements. [2025-03-09 00:27:15,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:27:15,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:15,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 00:27:15,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:15,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:27:15,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 00:27:15,265 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 17 treesize of output 9 [2025-03-09 00:27:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-09 00:27:15,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:15,333 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 18 treesize of output 16 [2025-03-09 00:27:15,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 00:27:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-09 00:27:15,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588261004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:15,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:15,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2025-03-09 00:27:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670001853] [2025-03-09 00:27:15,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 00:27:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:15,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 00:27:15,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:27:15,401 INFO L87 Difference]: Start difference. First operand 300 states and 316 transitions. Second operand has 16 states, 15 states have (on average 7.533333333333333) internal successors, (113), 16 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:15,672 INFO L93 Difference]: Finished difference Result 501 states and 533 transitions. [2025-03-09 00:27:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:27:15,673 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.533333333333333) internal successors, (113), 16 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 172 [2025-03-09 00:27:15,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:15,674 INFO L225 Difference]: With dead ends: 501 [2025-03-09 00:27:15,674 INFO L226 Difference]: Without dead ends: 501 [2025-03-09 00:27:15,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-09 00:27:15,675 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 430 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:15,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1007 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:27:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-09 00:27:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 368. [2025-03-09 00:27:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 343 states have (on average 1.1253644314868805) internal successors, (386), 365 states have internal predecessors, (386), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 388 transitions. [2025-03-09 00:27:15,679 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 388 transitions. Word has length 172 [2025-03-09 00:27:15,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:15,680 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 388 transitions. [2025-03-09 00:27:15,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.533333333333333) internal successors, (113), 16 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 388 transitions. [2025-03-09 00:27:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-09 00:27:15,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:15,681 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:15,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 00:27:15,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:15,882 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:27:15,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:15,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1934737900, now seen corresponding path program 1 times [2025-03-09 00:27:15,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:15,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128245073] [2025-03-09 00:27:15,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:15,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:15,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-09 00:27:15,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-09 00:27:15,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:15,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2025-03-09 00:27:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:16,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128245073] [2025-03-09 00:27:16,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128245073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:16,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683297251] [2025-03-09 00:27:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:16,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:16,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:16,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:16,081 INFO L87 Difference]: Start difference. First operand 368 states and 388 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:16,084 INFO L93 Difference]: Finished difference Result 331 states and 343 transitions. [2025-03-09 00:27:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:16,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2025-03-09 00:27:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:16,085 INFO L225 Difference]: With dead ends: 331 [2025-03-09 00:27:16,086 INFO L226 Difference]: Without dead ends: 331 [2025-03-09 00:27:16,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:16,086 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:16,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-09 00:27:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2025-03-09 00:27:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 322 states have (on average 1.0590062111801242) internal successors, (341), 328 states have internal predecessors, (341), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 343 transitions. [2025-03-09 00:27:16,090 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 343 transitions. Word has length 173 [2025-03-09 00:27:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:16,090 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 343 transitions. [2025-03-09 00:27:16,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 343 transitions. [2025-03-09 00:27:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-09 00:27:16,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:16,091 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:16,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-09 00:27:16,091 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:27:16,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1934778583, now seen corresponding path program 1 times [2025-03-09 00:27:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375222075] [2025-03-09 00:27:16,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:16,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-09 00:27:16,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-09 00:27:16,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:16,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-09 00:27:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375222075] [2025-03-09 00:27:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375222075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922774824] [2025-03-09 00:27:17,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:17,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:17,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:17,125 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:17,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 00:27:17,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-09 00:27:17,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-09 00:27:17,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:17,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:17,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 00:27:17,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:17,699 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-03-09 00:27:17,715 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 19 treesize of output 1 [2025-03-09 00:27:17,716 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 13 treesize of output 9 [2025-03-09 00:27:17,901 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 21 treesize of output 9 [2025-03-09 00:27:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-09 00:27:17,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:18,091 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 33 treesize of output 31 [2025-03-09 00:27:18,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2025-03-09 00:27:18,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-03-09 00:27:18,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-09 00:27:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-09 00:27:18,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922774824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:18,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:18,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2025-03-09 00:27:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081426451] [2025-03-09 00:27:18,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:18,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:27:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:18,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:27:18,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-03-09 00:27:18,154 INFO L87 Difference]: Start difference. First operand 331 states and 343 transitions. Second operand has 22 states, 21 states have (on average 5.809523809523809) internal successors, (122), 22 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:18,367 INFO L93 Difference]: Finished difference Result 426 states and 444 transitions. [2025-03-09 00:27:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:27:18,367 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.809523809523809) internal successors, (122), 22 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2025-03-09 00:27:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:18,369 INFO L225 Difference]: With dead ends: 426 [2025-03-09 00:27:18,369 INFO L226 Difference]: Without dead ends: 426 [2025-03-09 00:27:18,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:27:18,369 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 238 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:18,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 636 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:27:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-09 00:27:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 332. [2025-03-09 00:27:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 323 states have (on average 1.0588235294117647) internal successors, (342), 329 states have internal predecessors, (342), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 344 transitions. [2025-03-09 00:27:18,373 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 344 transitions. Word has length 173 [2025-03-09 00:27:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:18,373 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 344 transitions. [2025-03-09 00:27:18,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.809523809523809) internal successors, (122), 22 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 344 transitions. [2025-03-09 00:27:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-09 00:27:18,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:18,374 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:18,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 00:27:18,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:18,575 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-09 00:27:18,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:18,575 INFO L85 PathProgramCache]: Analyzing trace with hash 897426966, now seen corresponding path program 3 times [2025-03-09 00:27:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:18,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015346468] [2025-03-09 00:27:18,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:27:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:18,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 173 statements into 19 equivalence classes. [2025-03-09 00:27:19,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) and asserted 173 of 173 statements. [2025-03-09 00:27:19,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2025-03-09 00:27:19,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:27:20,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:20,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015346468] [2025-03-09 00:27:20,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015346468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:20,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773335749] [2025-03-09 00:27:20,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:27:20,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:20,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:20,096 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:20,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 00:27:20,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 173 statements into 19 equivalence classes.