./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:25:04,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:25:04,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:25:04,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:25:04,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:25:04,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:25:04,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:25:04,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:25:04,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:25:04,334 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:25:04,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:25:04,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:25:04,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:25:04,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:25:04,335 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:25:04,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:25:04,335 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:25:04,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:25:04,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:25:04,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:25:04,336 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:25:04,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:25:04,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:25:04,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:25:04,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:25:04,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:25:04,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:25:04,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:25:04,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:25:04,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:25:04,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:25:04,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:25:04,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:25:04,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:25:04,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:25:04,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:25:04,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:25:04,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:25:04,338 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 [2025-01-10 00:25:04,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:25:04,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:25:04,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:25:04,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:25:04,577 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:25:04,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2025-01-10 00:25:05,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30c599c5d/e36e6bc67f754ca6a1f561b5514ccd58/FLAG164ab24ae [2025-01-10 00:25:06,057 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:25:06,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2025-01-10 00:25:06,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30c599c5d/e36e6bc67f754ca6a1f561b5514ccd58/FLAG164ab24ae [2025-01-10 00:25:06,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30c599c5d/e36e6bc67f754ca6a1f561b5514ccd58 [2025-01-10 00:25:06,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:25:06,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:25:06,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:25:06,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:25:06,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:25:06,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cba08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06, skipping insertion in model container [2025-01-10 00:25:06,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:25:06,428 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,455 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,457 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,460 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,463 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,493 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,494 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,498 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,503 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,523 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,523 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,524 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,524 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:25:06,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:25:06,539 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:25:06,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:25:06,659 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:25:06,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06 WrapperNode [2025-01-10 00:25:06,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:25:06,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:25:06,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:25:06,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:25:06,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,734 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1990 [2025-01-10 00:25:06,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:25:06,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:25:06,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:25:06,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:25:06,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,825 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2025-01-10 00:25:06,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:25:06,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:25:06,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:25:06,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:25:06,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (1/1) ... [2025-01-10 00:25:06,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:25:06,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:06,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:25:06,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 00:25:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 00:25:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 00:25:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:25:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:25:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:25:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:25:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:25:06,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:25:07,136 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:25:07,138 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:25:07,152 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:25:07,172 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:25:07,187 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:25:09,269 INFO L? ?]: Removed 1734 outVars from TransFormulas that were not future-live. [2025-01-10 00:25:09,269 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:25:09,308 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:25:09,310 INFO L312 CfgBuilder]: Removed 39 assume(true) statements. [2025-01-10 00:25:09,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:25:09 BoogieIcfgContainer [2025-01-10 00:25:09,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:25:09,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:25:09,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:25:09,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:25:09,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:25:06" (1/3) ... [2025-01-10 00:25:09,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b36576c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:25:09, skipping insertion in model container [2025-01-10 00:25:09,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:25:06" (2/3) ... [2025-01-10 00:25:09,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b36576c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:25:09, skipping insertion in model container [2025-01-10 00:25:09,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:25:09" (3/3) ... [2025-01-10 00:25:09,316 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-1.i [2025-01-10 00:25:09,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:25:09,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test5-1.i that has 6 procedures, 1741 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2025-01-10 00:25:09,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:25:09,378 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;@2b5d16fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:25:09,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2025-01-10 00:25:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 1731 states, 1008 states have (on average 2.0337301587301586) internal successors, (2050), 1721 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:25:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:25:09,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:09,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:25:09,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr710ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:09,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash 65531891, now seen corresponding path program 1 times [2025-01-10 00:25:09,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:09,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281976630] [2025-01-10 00:25:09,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:09,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:09,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:25:09,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:25:09,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:09,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:09,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:09,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281976630] [2025-01-10 00:25:09,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281976630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:09,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:25:09,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126585266] [2025-01-10 00:25:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:09,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:25:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:09,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:25:09,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:09,592 INFO L87 Difference]: Start difference. First operand has 1731 states, 1008 states have (on average 2.0337301587301586) internal successors, (2050), 1721 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:09,818 INFO L93 Difference]: Finished difference Result 3403 states and 3923 transitions. [2025-01-10 00:25:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:25:09,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-10 00:25:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:09,847 INFO L225 Difference]: With dead ends: 3403 [2025-01-10 00:25:09,847 INFO L226 Difference]: Without dead ends: 3401 [2025-01-10 00:25:09,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:09,849 INFO L435 NwaCegarLoop]: 1969 mSDtfsCounter, 1927 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:09,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 3929 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:25:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2025-01-10 00:25:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 1711. [2025-01-10 00:25:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1000 states have (on average 1.947) internal successors, (1947), 1701 states have internal predecessors, (1947), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 1971 transitions. [2025-01-10 00:25:09,984 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 1971 transitions. Word has length 5 [2025-01-10 00:25:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:09,985 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 1971 transitions. [2025-01-10 00:25:09,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 1971 transitions. [2025-01-10 00:25:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:25:09,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:09,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:25:09,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:25:09,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:09,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 63049834, now seen corresponding path program 1 times [2025-01-10 00:25:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827415244] [2025-01-10 00:25:09,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:10,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:25:10,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:25:10,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:10,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:10,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:10,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827415244] [2025-01-10 00:25:10,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827415244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:10,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:10,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:25:10,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718822608] [2025-01-10 00:25:10,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:10,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:25:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:10,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:25:10,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:10,084 INFO L87 Difference]: Start difference. First operand 1711 states and 1971 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:10,855 INFO L93 Difference]: Finished difference Result 1619 states and 1879 transitions. [2025-01-10 00:25:10,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:25:10,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-10 00:25:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:10,861 INFO L225 Difference]: With dead ends: 1619 [2025-01-10 00:25:10,861 INFO L226 Difference]: Without dead ends: 1619 [2025-01-10 00:25:10,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:10,862 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 1730 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:10,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 1188 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:25:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-01-10 00:25:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2025-01-10 00:25:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1000 states have (on average 1.855) internal successors, (1855), 1609 states have internal predecessors, (1855), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 1879 transitions. [2025-01-10 00:25:10,885 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 1879 transitions. Word has length 5 [2025-01-10 00:25:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:10,886 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 1879 transitions. [2025-01-10 00:25:10,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 1879 transitions. [2025-01-10 00:25:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:25:10,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:10,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:25:10,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:25:10,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:10,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 63049835, now seen corresponding path program 1 times [2025-01-10 00:25:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394508712] [2025-01-10 00:25:10,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:10,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:25:10,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:25:10,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:10,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394508712] [2025-01-10 00:25:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394508712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:10,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:10,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:25:10,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456022756] [2025-01-10 00:25:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:10,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:25:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:10,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:25:10,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:10,968 INFO L87 Difference]: Start difference. First operand 1619 states and 1879 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:11,839 INFO L93 Difference]: Finished difference Result 2353 states and 2777 transitions. [2025-01-10 00:25:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:25:11,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-10 00:25:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:11,846 INFO L225 Difference]: With dead ends: 2353 [2025-01-10 00:25:11,846 INFO L226 Difference]: Without dead ends: 2353 [2025-01-10 00:25:11,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:11,847 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1212 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:11,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 2463 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:25:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2025-01-10 00:25:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1881. [2025-01-10 00:25:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1272 states have (on average 1.830188679245283) internal successors, (2328), 1871 states have internal predecessors, (2328), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2352 transitions. [2025-01-10 00:25:11,880 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2352 transitions. Word has length 5 [2025-01-10 00:25:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:11,880 INFO L471 AbstractCegarLoop]: Abstraction has 1881 states and 2352 transitions. [2025-01-10 00:25:11,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2352 transitions. [2025-01-10 00:25:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 00:25:11,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:11,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:11,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:25:11,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:11,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:11,881 INFO L85 PathProgramCache]: Analyzing trace with hash 477027540, now seen corresponding path program 1 times [2025-01-10 00:25:11,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:11,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155003601] [2025-01-10 00:25:11,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:11,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:25:11,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:25:11,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:11,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:11,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:11,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155003601] [2025-01-10 00:25:11,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155003601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:11,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:11,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:25:11,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420881340] [2025-01-10 00:25:11,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:11,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:25:11,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:11,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:25:11,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:25:11,955 INFO L87 Difference]: Start difference. First operand 1881 states and 2352 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:12,874 INFO L93 Difference]: Finished difference Result 1907 states and 2405 transitions. [2025-01-10 00:25:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:25:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-01-10 00:25:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:12,880 INFO L225 Difference]: With dead ends: 1907 [2025-01-10 00:25:12,880 INFO L226 Difference]: Without dead ends: 1907 [2025-01-10 00:25:12,880 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-01-10 00:25:12,881 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 1997 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:12,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 2163 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:25:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2025-01-10 00:25:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1858. [2025-01-10 00:25:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1272 states have (on average 1.8121069182389937) internal successors, (2305), 1848 states have internal predecessors, (2305), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2329 transitions. [2025-01-10 00:25:12,903 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2329 transitions. Word has length 11 [2025-01-10 00:25:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:12,903 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2329 transitions. [2025-01-10 00:25:12,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2329 transitions. [2025-01-10 00:25:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 00:25:12,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:12,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:12,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:25:12,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:12,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash 477027541, now seen corresponding path program 1 times [2025-01-10 00:25:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:12,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817425805] [2025-01-10 00:25:12,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:12,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:12,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:25:12,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:25:12,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:12,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:12,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:12,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817425805] [2025-01-10 00:25:12,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817425805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:12,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:25:12,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374873903] [2025-01-10 00:25:12,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:12,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:25:12,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:12,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:25:12,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:12,960 INFO L87 Difference]: Start difference. First operand 1858 states and 2329 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:12,999 INFO L93 Difference]: Finished difference Result 1783 states and 2226 transitions. [2025-01-10 00:25:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:25:12,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-01-10 00:25:12,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:13,008 INFO L225 Difference]: With dead ends: 1783 [2025-01-10 00:25:13,008 INFO L226 Difference]: Without dead ends: 1783 [2025-01-10 00:25:13,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:13,009 INFO L435 NwaCegarLoop]: 1730 mSDtfsCounter, 60 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3407 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:13,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3407 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:25:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-01-10 00:25:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2025-01-10 00:25:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1209 states have (on average 1.8213399503722085) internal successors, (2202), 1773 states have internal predecessors, (2202), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2226 transitions. [2025-01-10 00:25:13,088 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2226 transitions. Word has length 11 [2025-01-10 00:25:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:13,089 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2226 transitions. [2025-01-10 00:25:13,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2226 transitions. [2025-01-10 00:25:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 00:25:13,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:13,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:13,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:25:13,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:13,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1903167439, now seen corresponding path program 1 times [2025-01-10 00:25:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:13,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137068652] [2025-01-10 00:25:13,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:13,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:25:13,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:25:13,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:13,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137068652] [2025-01-10 00:25:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137068652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:13,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:13,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:25:13,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628897636] [2025-01-10 00:25:13,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:13,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:25:13,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:13,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:25:13,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:25:13,173 INFO L87 Difference]: Start difference. First operand 1783 states and 2226 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:13,250 INFO L93 Difference]: Finished difference Result 1765 states and 2201 transitions. [2025-01-10 00:25:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:25:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 00:25:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:13,260 INFO L225 Difference]: With dead ends: 1765 [2025-01-10 00:25:13,263 INFO L226 Difference]: Without dead ends: 1765 [2025-01-10 00:25:13,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:25:13,264 INFO L435 NwaCegarLoop]: 1695 mSDtfsCounter, 41 mSDsluCounter, 3362 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:13,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5057 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:25:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-01-10 00:25:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1762. [2025-01-10 00:25:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1195 states have (on average 1.8192468619246862) internal successors, (2174), 1752 states have internal predecessors, (2174), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2198 transitions. [2025-01-10 00:25:13,308 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2198 transitions. Word has length 12 [2025-01-10 00:25:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:13,309 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2198 transitions. [2025-01-10 00:25:13,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2198 transitions. [2025-01-10 00:25:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 00:25:13,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:13,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:13,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:25:13,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:13,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1855964541, now seen corresponding path program 1 times [2025-01-10 00:25:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751990675] [2025-01-10 00:25:13,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:13,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:25:13,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:25:13,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:13,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:13,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751990675] [2025-01-10 00:25:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751990675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:13,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:25:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576605252] [2025-01-10 00:25:13,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:13,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:25:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:13,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:25:13,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:25:13,450 INFO L87 Difference]: Start difference. First operand 1762 states and 2198 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:14,740 INFO L93 Difference]: Finished difference Result 2279 states and 2695 transitions. [2025-01-10 00:25:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:25:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-10 00:25:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:14,745 INFO L225 Difference]: With dead ends: 2279 [2025-01-10 00:25:14,745 INFO L226 Difference]: Without dead ends: 2279 [2025-01-10 00:25:14,746 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-01-10 00:25:14,746 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 1217 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:14,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 3366 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:25:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2025-01-10 00:25:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1758. [2025-01-10 00:25:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1195 states have (on average 1.8158995815899581) internal successors, (2170), 1748 states have internal predecessors, (2170), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2194 transitions. [2025-01-10 00:25:14,766 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2194 transitions. Word has length 26 [2025-01-10 00:25:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:14,767 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2194 transitions. [2025-01-10 00:25:14,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2194 transitions. [2025-01-10 00:25:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 00:25:14,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:14,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:14,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:25:14,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:14,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash -754980717, now seen corresponding path program 1 times [2025-01-10 00:25:14,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:14,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161886189] [2025-01-10 00:25:14,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:14,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 00:25:14,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 00:25:14,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:14,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:14,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:14,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161886189] [2025-01-10 00:25:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161886189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:14,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:14,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:25:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092891995] [2025-01-10 00:25:14,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:14,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:25:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:14,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:25:14,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:25:14,855 INFO L87 Difference]: Start difference. First operand 1758 states and 2194 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:14,897 INFO L93 Difference]: Finished difference Result 1758 states and 2190 transitions. [2025-01-10 00:25:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:25:14,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-10 00:25:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:14,903 INFO L225 Difference]: With dead ends: 1758 [2025-01-10 00:25:14,903 INFO L226 Difference]: Without dead ends: 1758 [2025-01-10 00:25:14,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:25:14,904 INFO L435 NwaCegarLoop]: 1690 mSDtfsCounter, 21 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:14,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5039 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:25:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2025-01-10 00:25:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1758. [2025-01-10 00:25:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1195 states have (on average 1.81255230125523) internal successors, (2166), 1748 states have internal predecessors, (2166), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2190 transitions. [2025-01-10 00:25:14,946 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2190 transitions. Word has length 60 [2025-01-10 00:25:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:14,947 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2190 transitions. [2025-01-10 00:25:14,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2190 transitions. [2025-01-10 00:25:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:25:14,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:14,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:14,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:25:14,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:14,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash -428091937, now seen corresponding path program 1 times [2025-01-10 00:25:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115255641] [2025-01-10 00:25:14,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:14,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:25:14,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:25:14,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:14,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:15,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115255641] [2025-01-10 00:25:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115255641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:25:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525830833] [2025-01-10 00:25:15,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:15,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:25:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:15,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:25:15,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:15,052 INFO L87 Difference]: Start difference. First operand 1758 states and 2190 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:15,084 INFO L93 Difference]: Finished difference Result 1849 states and 2308 transitions. [2025-01-10 00:25:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:25:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 68 [2025-01-10 00:25:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:15,088 INFO L225 Difference]: With dead ends: 1849 [2025-01-10 00:25:15,088 INFO L226 Difference]: Without dead ends: 1849 [2025-01-10 00:25:15,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:25:15,089 INFO L435 NwaCegarLoop]: 1704 mSDtfsCounter, 54 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:15,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3381 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:25:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-01-10 00:25:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1849. [2025-01-10 00:25:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1286 states have (on average 1.776049766718507) internal successors, (2284), 1839 states have internal predecessors, (2284), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2308 transitions. [2025-01-10 00:25:15,107 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2308 transitions. Word has length 68 [2025-01-10 00:25:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:15,107 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 2308 transitions. [2025-01-10 00:25:15,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2308 transitions. [2025-01-10 00:25:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 00:25:15,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:15,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:15,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:25:15,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:15,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1638039152, now seen corresponding path program 1 times [2025-01-10 00:25:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:15,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755681106] [2025-01-10 00:25:15,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:15,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 00:25:15,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 00:25:15,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:15,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:15,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:15,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755681106] [2025-01-10 00:25:15,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755681106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:15,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:15,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:25:15,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898013708] [2025-01-10 00:25:15,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:15,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:25:15,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:15,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:25:15,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:25:15,595 INFO L87 Difference]: Start difference. First operand 1849 states and 2308 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:16,958 INFO L93 Difference]: Finished difference Result 1765 states and 2224 transitions. [2025-01-10 00:25:16,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:25:16,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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 71 [2025-01-10 00:25:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:16,962 INFO L225 Difference]: With dead ends: 1765 [2025-01-10 00:25:16,962 INFO L226 Difference]: Without dead ends: 1765 [2025-01-10 00:25:16,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:25:16,962 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 3033 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3044 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:16,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3044 Valid, 2350 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:25:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-01-10 00:25:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1493. [2025-01-10 00:25:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1014 states have (on average 1.693293885601578) internal successors, (1717), 1483 states have internal predecessors, (1717), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1741 transitions. [2025-01-10 00:25:16,977 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1741 transitions. Word has length 71 [2025-01-10 00:25:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:16,977 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1741 transitions. [2025-01-10 00:25:16,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1741 transitions. [2025-01-10 00:25:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:25:16,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:16,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:16,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:25:16,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:16,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash 184750066, now seen corresponding path program 1 times [2025-01-10 00:25:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:16,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411230416] [2025-01-10 00:25:16,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:16,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:25:17,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:25:17,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:17,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411230416] [2025-01-10 00:25:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411230416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:17,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:17,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:25:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965916821] [2025-01-10 00:25:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:17,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:25:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:17,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:25:17,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:25:17,159 INFO L87 Difference]: Start difference. First operand 1493 states and 1741 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:18,065 INFO L93 Difference]: Finished difference Result 1492 states and 1740 transitions. [2025-01-10 00:25:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:25:18,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-01-10 00:25:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:18,068 INFO L225 Difference]: With dead ends: 1492 [2025-01-10 00:25:18,069 INFO L226 Difference]: Without dead ends: 1492 [2025-01-10 00:25:18,069 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-01-10 00:25:18,069 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 2 mSDsluCounter, 3134 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:18,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4750 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:25:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-01-10 00:25:18,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2025-01-10 00:25:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1014 states have (on average 1.6923076923076923) internal successors, (1716), 1482 states have internal predecessors, (1716), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1740 transitions. [2025-01-10 00:25:18,082 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1740 transitions. Word has length 76 [2025-01-10 00:25:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:18,082 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1740 transitions. [2025-01-10 00:25:18,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1740 transitions. [2025-01-10 00:25:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:25:18,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:18,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:18,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:25:18,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:18,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:18,083 INFO L85 PathProgramCache]: Analyzing trace with hash 184750067, now seen corresponding path program 1 times [2025-01-10 00:25:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595871558] [2025-01-10 00:25:18,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:18,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:25:18,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:25:18,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:18,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:18,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:18,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595871558] [2025-01-10 00:25:18,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595871558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:18,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:18,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:25:18,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733441210] [2025-01-10 00:25:18,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:18,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:25:18,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:18,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:25:18,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:25:18,417 INFO L87 Difference]: Start difference. First operand 1492 states and 1740 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:19,501 INFO L93 Difference]: Finished difference Result 1491 states and 1739 transitions. [2025-01-10 00:25:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:25:19,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-01-10 00:25:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:19,504 INFO L225 Difference]: With dead ends: 1491 [2025-01-10 00:25:19,504 INFO L226 Difference]: Without dead ends: 1491 [2025-01-10 00:25:19,505 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-01-10 00:25:19,505 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4772 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:19,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4772 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:25:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2025-01-10 00:25:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2025-01-10 00:25:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1013 states have (on average 1.6929911154985193) internal successors, (1715), 1481 states have internal predecessors, (1715), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1739 transitions. [2025-01-10 00:25:19,517 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1739 transitions. Word has length 76 [2025-01-10 00:25:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:19,518 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1739 transitions. [2025-01-10 00:25:19,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:25:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1739 transitions. [2025-01-10 00:25:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:25:19,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:19,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:19,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:25:19,519 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:19,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash 55751129, now seen corresponding path program 1 times [2025-01-10 00:25:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778731941] [2025-01-10 00:25:19,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:19,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:25:19,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:25:19,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:19,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:19,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778731941] [2025-01-10 00:25:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778731941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:19,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:25:19,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648801962] [2025-01-10 00:25:19,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:19,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:25:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:19,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:25:19,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:25:19,684 INFO L87 Difference]: Start difference. First operand 1491 states and 1739 transitions. Second operand has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 00:25:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:20,854 INFO L93 Difference]: Finished difference Result 1503 states and 1757 transitions. [2025-01-10 00:25:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:25:20,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 84 [2025-01-10 00:25:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:20,858 INFO L225 Difference]: With dead ends: 1503 [2025-01-10 00:25:20,858 INFO L226 Difference]: Without dead ends: 1503 [2025-01-10 00:25:20,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:25:20,863 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 13 mSDsluCounter, 5830 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7428 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:20,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7428 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:25:20,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-01-10 00:25:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1497. [2025-01-10 00:25:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1018 states have (on average 1.6915520628683693) internal successors, (1722), 1486 states have internal predecessors, (1722), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 00:25:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1752 transitions. [2025-01-10 00:25:20,896 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1752 transitions. Word has length 84 [2025-01-10 00:25:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:20,897 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1752 transitions. [2025-01-10 00:25:20,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 00:25:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1752 transitions. [2025-01-10 00:25:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:25:20,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:20,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:20,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:25:20,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:20,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash 55751130, now seen corresponding path program 1 times [2025-01-10 00:25:20,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:20,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051296971] [2025-01-10 00:25:20,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:20,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:20,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:25:20,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:25:20,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:20,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:21,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:21,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051296971] [2025-01-10 00:25:21,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051296971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:21,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:21,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:25:21,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632438215] [2025-01-10 00:25:21,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:21,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:25:21,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:21,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:25:21,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:25:21,296 INFO L87 Difference]: Start difference. First operand 1497 states and 1752 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 00:25:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:22,537 INFO L93 Difference]: Finished difference Result 1497 states and 1751 transitions. [2025-01-10 00:25:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:25:22,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 84 [2025-01-10 00:25:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:22,541 INFO L225 Difference]: With dead ends: 1497 [2025-01-10 00:25:22,541 INFO L226 Difference]: Without dead ends: 1497 [2025-01-10 00:25:22,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:25:22,542 INFO L435 NwaCegarLoop]: 1605 mSDtfsCounter, 8 mSDsluCounter, 4494 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6099 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:22,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6099 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:25:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-01-10 00:25:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2025-01-10 00:25:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1018 states have (on average 1.6905697445972494) internal successors, (1721), 1486 states have internal predecessors, (1721), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 00:25:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1751 transitions. [2025-01-10 00:25:22,572 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1751 transitions. Word has length 84 [2025-01-10 00:25:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:22,573 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1751 transitions. [2025-01-10 00:25:22,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 00:25:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1751 transitions. [2025-01-10 00:25:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:25:22,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:22,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:22,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:25:22,578 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:22,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:22,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1240902629, now seen corresponding path program 1 times [2025-01-10 00:25:22,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:22,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763193441] [2025-01-10 00:25:22,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:22,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:22,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:25:22,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:25:22,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:22,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763193441] [2025-01-10 00:25:22,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763193441] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125649969] [2025-01-10 00:25:22,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:22,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:22,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:22,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:22,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:25:23,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:25:23,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:25:23,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:23,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:23,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 00:25:23,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:23,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:25:23,223 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:23,224 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-01-10 00:25:23,238 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 19 treesize of output 1 [2025-01-10 00:25:23,304 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:23,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:23,330 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 13 [2025-01-10 00:25:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:23,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:23,381 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-01-10 00:25:23,381 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 21 treesize of output 20 [2025-01-10 00:25:23,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125649969] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:23,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:23,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-01-10 00:25:23,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982513645] [2025-01-10 00:25:23,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:23,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:25:23,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:23,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:25:23,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=171, Unknown=4, NotChecked=0, Total=210 [2025-01-10 00:25:23,420 INFO L87 Difference]: Start difference. First operand 1497 states and 1751 transitions. Second operand has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:25:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:25,935 INFO L93 Difference]: Finished difference Result 1496 states and 1750 transitions. [2025-01-10 00:25:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:25:25,935 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2025-01-10 00:25:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:25,939 INFO L225 Difference]: With dead ends: 1496 [2025-01-10 00:25:25,939 INFO L226 Difference]: Without dead ends: 1496 [2025-01-10 00:25:25,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=374, Unknown=4, NotChecked=0, Total=462 [2025-01-10 00:25:25,940 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 1533 mSDsluCounter, 9135 mSDsCounter, 0 mSdLazyCounter, 5968 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 10173 SdHoareTripleChecker+Invalid, 5994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:25,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 10173 Invalid, 5994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5968 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-10 00:25:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-01-10 00:25:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2025-01-10 00:25:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1018 states have (on average 1.6895874263261297) internal successors, (1720), 1485 states have internal predecessors, (1720), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 00:25:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1750 transitions. [2025-01-10 00:25:25,964 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1750 transitions. Word has length 85 [2025-01-10 00:25:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:25,964 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1750 transitions. [2025-01-10 00:25:25,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:25:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1750 transitions. [2025-01-10 00:25:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:25:25,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:25,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:25,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:25:26,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 00:25:26,165 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:26,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1240902630, now seen corresponding path program 1 times [2025-01-10 00:25:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:26,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499833956] [2025-01-10 00:25:26,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:26,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:25:26,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:25:26,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:26,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:26,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:26,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499833956] [2025-01-10 00:25:26,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499833956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:26,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538153311] [2025-01-10 00:25:26,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:26,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:26,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:26,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:26,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:25:26,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:25:26,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:25:26,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:26,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:26,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 00:25:26,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:26,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:25:26,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:25:26,984 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:26,984 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-01-10 00:25:27,018 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-01-10 00:25:27,025 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 19 treesize of output 1 [2025-01-10 00:25:27,145 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 22 treesize of output 10 [2025-01-10 00:25:27,150 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 9 treesize of output 3 [2025-01-10 00:25:27,243 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:27,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:27,248 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 30 treesize of output 13 [2025-01-10 00:25:27,281 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 13 [2025-01-10 00:25:27,284 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 9 treesize of output 3 [2025-01-10 00:25:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:27,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:27,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538153311] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:27,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:27,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-01-10 00:25:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327596824] [2025-01-10 00:25:27,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:27,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:25:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:27,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:25:27,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=348, Unknown=11, NotChecked=0, Total=420 [2025-01-10 00:25:27,410 INFO L87 Difference]: Start difference. First operand 1496 states and 1750 transitions. Second operand has 18 states, 15 states have (on average 8.866666666666667) internal successors, (133), 18 states have internal predecessors, (133), 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-01-10 00:25:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:31,389 INFO L93 Difference]: Finished difference Result 1503 states and 1757 transitions. [2025-01-10 00:25:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:25:31,394 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.866666666666667) internal successors, (133), 18 states have internal predecessors, (133), 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 85 [2025-01-10 00:25:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:31,397 INFO L225 Difference]: With dead ends: 1503 [2025-01-10 00:25:31,397 INFO L226 Difference]: Without dead ends: 1503 [2025-01-10 00:25:31,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=493, Unknown=12, NotChecked=0, Total=600 [2025-01-10 00:25:31,401 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1535 mSDsluCounter, 9346 mSDsCounter, 0 mSdLazyCounter, 8933 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 10389 SdHoareTripleChecker+Invalid, 8975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 8933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:31,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 10389 Invalid, 8975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 8933 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-10 00:25:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-01-10 00:25:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1494. [2025-01-10 00:25:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1017 states have (on average 1.6892822025565388) internal successors, (1718), 1483 states have internal predecessors, (1718), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1742 transitions. [2025-01-10 00:25:31,415 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1742 transitions. Word has length 85 [2025-01-10 00:25:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:31,415 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1742 transitions. [2025-01-10 00:25:31,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.866666666666667) internal successors, (133), 18 states have internal predecessors, (133), 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-01-10 00:25:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1742 transitions. [2025-01-10 00:25:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 00:25:31,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:31,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:31,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:25:31,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 00:25:31,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:31,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1269842825, now seen corresponding path program 1 times [2025-01-10 00:25:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968818751] [2025-01-10 00:25:31,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:31,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 00:25:31,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 00:25:31,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:31,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968818751] [2025-01-10 00:25:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968818751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:32,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:32,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:25:32,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62337528] [2025-01-10 00:25:32,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:32,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:25:32,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:32,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:25:32,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:25:32,039 INFO L87 Difference]: Start difference. First operand 1494 states and 1742 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 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-01-10 00:25:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:34,269 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2025-01-10 00:25:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:25:34,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 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 87 [2025-01-10 00:25:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:34,275 INFO L225 Difference]: With dead ends: 1507 [2025-01-10 00:25:34,277 INFO L226 Difference]: Without dead ends: 1507 [2025-01-10 00:25:34,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:25:34,278 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1555 mSDsluCounter, 10119 mSDsCounter, 0 mSdLazyCounter, 6575 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 11156 SdHoareTripleChecker+Invalid, 6600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:34,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 11156 Invalid, 6600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6575 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-10 00:25:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-01-10 00:25:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1503. [2025-01-10 00:25:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1025 states have (on average 1.6858536585365853) internal successors, (1728), 1491 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:25:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1753 transitions. [2025-01-10 00:25:34,292 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1753 transitions. Word has length 87 [2025-01-10 00:25:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:34,292 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1753 transitions. [2025-01-10 00:25:34,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 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-01-10 00:25:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1753 transitions. [2025-01-10 00:25:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 00:25:34,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:34,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:34,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:25:34,295 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:34,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:34,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1269842824, now seen corresponding path program 1 times [2025-01-10 00:25:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:34,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850002692] [2025-01-10 00:25:34,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:34,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:34,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 00:25:34,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 00:25:34,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:34,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:34,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:34,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850002692] [2025-01-10 00:25:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850002692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:34,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:25:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695771951] [2025-01-10 00:25:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:34,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:25:34,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:34,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:25:34,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:25:34,684 INFO L87 Difference]: Start difference. First operand 1503 states and 1753 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 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-01-10 00:25:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:37,041 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2025-01-10 00:25:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:25:37,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 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 87 [2025-01-10 00:25:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:37,044 INFO L225 Difference]: With dead ends: 1506 [2025-01-10 00:25:37,044 INFO L226 Difference]: Without dead ends: 1506 [2025-01-10 00:25:37,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:25:37,045 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1553 mSDsluCounter, 5207 mSDsCounter, 0 mSdLazyCounter, 5056 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 6251 SdHoareTripleChecker+Invalid, 5080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:37,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 6251 Invalid, 5080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5056 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-10 00:25:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-10 00:25:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1503. [2025-01-10 00:25:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1025 states have (on average 1.6848780487804877) internal successors, (1727), 1491 states have internal predecessors, (1727), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:25:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1752 transitions. [2025-01-10 00:25:37,082 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1752 transitions. Word has length 87 [2025-01-10 00:25:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:37,082 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1752 transitions. [2025-01-10 00:25:37,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 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-01-10 00:25:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1752 transitions. [2025-01-10 00:25:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:25:37,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:37,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:37,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:25:37,083 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:37,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash 947320555, now seen corresponding path program 1 times [2025-01-10 00:25:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:37,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405890743] [2025-01-10 00:25:37,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:37,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:25:37,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:25:37,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:37,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:37,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405890743] [2025-01-10 00:25:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405890743] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785606852] [2025-01-10 00:25:37,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:37,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:37,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:37,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:37,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:25:37,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:25:37,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:25:37,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:37,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:37,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:25:37,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:37,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:25:37,825 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:37,826 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-01-10 00:25:37,835 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 19 treesize of output 1 [2025-01-10 00:25:37,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:37,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:37,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:37,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:37,966 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 13 [2025-01-10 00:25:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:37,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:37,981 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_925 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_925) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:25:37,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_925 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_925) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-01-10 00:25:38,043 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-01-10 00:25:38,043 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 33 treesize of output 32 [2025-01-10 00:25:38,056 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_925 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_928))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_925)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-01-10 00:25:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785606852] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:38,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:38,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2025-01-10 00:25:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678427979] [2025-01-10 00:25:38,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:38,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:25:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:38,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:25:38,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2025-01-10 00:25:38,058 INFO L87 Difference]: Start difference. First operand 1503 states and 1752 transitions. Second operand has 16 states, 14 states have (on average 9.0) internal successors, (126), 15 states have internal predecessors, (126), 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-01-10 00:25:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:40,691 INFO L93 Difference]: Finished difference Result 1505 states and 1759 transitions. [2025-01-10 00:25:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:25:40,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.0) internal successors, (126), 15 states have internal predecessors, (126), 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 88 [2025-01-10 00:25:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:40,702 INFO L225 Difference]: With dead ends: 1505 [2025-01-10 00:25:40,703 INFO L226 Difference]: Without dead ends: 1505 [2025-01-10 00:25:40,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2025-01-10 00:25:40,704 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1527 mSDsluCounter, 11122 mSDsCounter, 0 mSdLazyCounter, 7173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 12159 SdHoareTripleChecker+Invalid, 7198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:40,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 12159 Invalid, 7198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7173 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-10 00:25:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-01-10 00:25:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1502. [2025-01-10 00:25:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1025 states have (on average 1.6839024390243902) internal successors, (1726), 1490 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:25:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1751 transitions. [2025-01-10 00:25:40,738 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1751 transitions. Word has length 88 [2025-01-10 00:25:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:40,738 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1751 transitions. [2025-01-10 00:25:40,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.0) internal successors, (126), 15 states have internal predecessors, (126), 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-01-10 00:25:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1751 transitions. [2025-01-10 00:25:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:25:40,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:40,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:40,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:25:40,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:40,939 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:40,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash 947320556, now seen corresponding path program 1 times [2025-01-10 00:25:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:40,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499718840] [2025-01-10 00:25:40,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:40,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:25:40,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:25:40,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:40,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:41,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:41,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499718840] [2025-01-10 00:25:41,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499718840] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:41,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091149097] [2025-01-10 00:25:41,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:41,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:41,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:41,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:41,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:25:41,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:25:41,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:25:41,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:41,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:41,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 00:25:41,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:41,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:25:41,933 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:41,933 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-01-10 00:25:41,939 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 8 treesize of output 1 [2025-01-10 00:25:41,948 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-01-10 00:25:41,952 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 19 treesize of output 1 [2025-01-10 00:25:41,991 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 22 treesize of output 10 [2025-01-10 00:25:41,995 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 9 treesize of output 3 [2025-01-10 00:25:42,072 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:42,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:42,075 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 30 treesize of output 13 [2025-01-10 00:25:42,129 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:42,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:42,132 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 30 treesize of output 13 [2025-01-10 00:25:42,146 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 13 [2025-01-10 00:25:42,150 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 9 treesize of output 3 [2025-01-10 00:25:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:42,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:42,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-01-10 00:25:42,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-01-10 00:25:42,242 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int)) (v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1075))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:25:42,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091149097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:42,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:42,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2025-01-10 00:25:42,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977957731] [2025-01-10 00:25:42,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:42,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:25:42,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:42,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:25:42,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2025-01-10 00:25:42,245 INFO L87 Difference]: Start difference. First operand 1502 states and 1751 transitions. Second operand has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 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-01-10 00:25:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:44,475 INFO L93 Difference]: Finished difference Result 1504 states and 1758 transitions. [2025-01-10 00:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:25:44,476 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 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 88 [2025-01-10 00:25:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:44,478 INFO L225 Difference]: With dead ends: 1504 [2025-01-10 00:25:44,478 INFO L226 Difference]: Without dead ends: 1504 [2025-01-10 00:25:44,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2025-01-10 00:25:44,480 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1532 mSDsluCounter, 5205 mSDsCounter, 0 mSdLazyCounter, 5068 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 6247 SdHoareTripleChecker+Invalid, 5107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 5068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:44,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 6247 Invalid, 5107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 5068 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-10 00:25:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-01-10 00:25:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1492. [2025-01-10 00:25:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1017 states have (on average 1.6873156342182891) internal successors, (1716), 1481 states have internal predecessors, (1716), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:25:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1740 transitions. [2025-01-10 00:25:44,495 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1740 transitions. Word has length 88 [2025-01-10 00:25:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:44,496 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1740 transitions. [2025-01-10 00:25:44,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 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-01-10 00:25:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1740 transitions. [2025-01-10 00:25:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 00:25:44,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:44,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:44,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:25:44,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:44,701 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:44,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:44,702 INFO L85 PathProgramCache]: Analyzing trace with hash 184967232, now seen corresponding path program 1 times [2025-01-10 00:25:44,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:44,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131416441] [2025-01-10 00:25:44,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:44,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 00:25:44,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 00:25:44,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:44,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:45,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:45,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131416441] [2025-01-10 00:25:45,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131416441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:45,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:45,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:25:45,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084116602] [2025-01-10 00:25:45,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:45,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:25:45,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:45,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:25:45,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:25:45,059 INFO L87 Difference]: Start difference. First operand 1492 states and 1740 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 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-01-10 00:25:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:47,167 INFO L93 Difference]: Finished difference Result 1508 states and 1762 transitions. [2025-01-10 00:25:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:25:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 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 90 [2025-01-10 00:25:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:47,170 INFO L225 Difference]: With dead ends: 1508 [2025-01-10 00:25:47,170 INFO L226 Difference]: Without dead ends: 1508 [2025-01-10 00:25:47,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-01-10 00:25:47,171 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1556 mSDsluCounter, 9129 mSDsCounter, 0 mSdLazyCounter, 5998 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 10165 SdHoareTripleChecker+Invalid, 6023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:47,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 10165 Invalid, 6023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5998 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-10 00:25:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-01-10 00:25:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1504. [2025-01-10 00:25:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1028 states have (on average 1.6819066147859922) internal successors, (1729), 1492 states have internal predecessors, (1729), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:25:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1754 transitions. [2025-01-10 00:25:47,184 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1754 transitions. Word has length 90 [2025-01-10 00:25:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:47,184 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1754 transitions. [2025-01-10 00:25:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 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-01-10 00:25:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1754 transitions. [2025-01-10 00:25:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 00:25:47,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:47,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:47,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:25:47,185 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash 184967233, now seen corresponding path program 1 times [2025-01-10 00:25:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576871179] [2025-01-10 00:25:47,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:47,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 00:25:47,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 00:25:47,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:47,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576871179] [2025-01-10 00:25:47,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576871179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:47,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:47,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:25:47,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509460667] [2025-01-10 00:25:47,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:47,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:25:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:47,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:25:47,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:25:47,814 INFO L87 Difference]: Start difference. First operand 1504 states and 1754 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 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-01-10 00:25:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:50,589 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2025-01-10 00:25:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:25:50,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 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 90 [2025-01-10 00:25:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:50,592 INFO L225 Difference]: With dead ends: 1507 [2025-01-10 00:25:50,592 INFO L226 Difference]: Without dead ends: 1507 [2025-01-10 00:25:50,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:25:50,599 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1537 mSDsluCounter, 6000 mSDsCounter, 0 mSdLazyCounter, 5869 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 7043 SdHoareTripleChecker+Invalid, 5893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:50,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 7043 Invalid, 5893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5869 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-10 00:25:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-01-10 00:25:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1504. [2025-01-10 00:25:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1028 states have (on average 1.6809338521400778) internal successors, (1728), 1492 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:25:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1753 transitions. [2025-01-10 00:25:50,612 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1753 transitions. Word has length 90 [2025-01-10 00:25:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:50,612 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1753 transitions. [2025-01-10 00:25:50,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 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-01-10 00:25:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1753 transitions. [2025-01-10 00:25:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:25:50,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:50,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:50,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:25:50,614 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:50,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash -602824372, now seen corresponding path program 1 times [2025-01-10 00:25:50,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:50,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808223472] [2025-01-10 00:25:50,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:50,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:25:50,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:25:50,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:50,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:50,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808223472] [2025-01-10 00:25:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808223472] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:50,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754170678] [2025-01-10 00:25:50,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:50,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:50,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:50,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:50,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:25:51,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:25:51,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:25:51,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:51,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:51,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 00:25:51,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:51,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:25:51,227 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:51,227 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-01-10 00:25:51,231 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 19 treesize of output 1 [2025-01-10 00:25:51,286 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:51,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:51,316 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:51,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:51,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:51,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:51,353 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 13 [2025-01-10 00:25:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:51,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:55,534 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-01-10 00:25:55,535 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 57 treesize of output 56 [2025-01-10 00:25:55,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1361))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1357)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1358)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-01-10 00:25:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754170678] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:55,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-01-10 00:25:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361944422] [2025-01-10 00:25:55,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:55,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:25:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:55,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:25:55,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=401, Unknown=35, NotChecked=42, Total=552 [2025-01-10 00:25:55,544 INFO L87 Difference]: Start difference. First operand 1504 states and 1753 transitions. Second operand has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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-01-10 00:25:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:58,818 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2025-01-10 00:25:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:25:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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 91 [2025-01-10 00:25:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:58,820 INFO L225 Difference]: With dead ends: 1506 [2025-01-10 00:25:58,820 INFO L226 Difference]: Without dead ends: 1506 [2025-01-10 00:25:58,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=146, Invalid=752, Unknown=36, NotChecked=58, Total=992 [2025-01-10 00:25:58,822 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1531 mSDsluCounter, 10141 mSDsCounter, 0 mSdLazyCounter, 6565 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 11177 SdHoareTripleChecker+Invalid, 6603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:58,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 11177 Invalid, 6603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6565 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-10 00:25:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-10 00:25:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1503. [2025-01-10 00:25:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1028 states have (on average 1.6799610894941635) internal successors, (1727), 1491 states have internal predecessors, (1727), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:25:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1752 transitions. [2025-01-10 00:25:58,832 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1752 transitions. Word has length 91 [2025-01-10 00:25:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:58,832 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1752 transitions. [2025-01-10 00:25:58,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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-01-10 00:25:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1752 transitions. [2025-01-10 00:25:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:25:58,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:58,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:58,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:25:59,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 00:25:59,040 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:25:59,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash -602824371, now seen corresponding path program 1 times [2025-01-10 00:25:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795696891] [2025-01-10 00:25:59,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:59,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:25:59,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:25:59,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:59,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795696891] [2025-01-10 00:25:59,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795696891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171591823] [2025-01-10 00:25:59,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:59,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:59,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:59,651 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:59,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:25:59,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:25:59,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:25:59,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:59,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:59,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 00:25:59,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:59,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:25:59,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:25:59,993 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:59,995 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-01-10 00:26:00,026 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 19 treesize of output 1 [2025-01-10 00:26:00,029 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-01-10 00:26:00,116 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 22 treesize of output 10 [2025-01-10 00:26:00,119 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 9 treesize of output 3 [2025-01-10 00:26:00,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:00,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:26:00,238 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 30 treesize of output 13 [2025-01-10 00:26:00,318 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:00,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:26:00,325 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 30 treesize of output 13 [2025-01-10 00:26:00,390 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:00,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:26:00,395 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 30 treesize of output 13 [2025-01-10 00:26:00,421 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 13 [2025-01-10 00:26:00,427 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 9 treesize of output 3 [2025-01-10 00:26:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:26:00,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:26:00,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:26:00,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:26:00,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1514))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515) .cse1 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:26:00,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1515) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1514))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1515) .cse2 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-01-10 00:26:00,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1522) .cse0 v_ArrVal_1515) (select (select (store .cse1 .cse0 v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1517))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1514))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1522) .cse3 v_ArrVal_1515) .cse4 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-01-10 00:26:00,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171591823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:26:00,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:26:00,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-01-10 00:26:00,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839809995] [2025-01-10 00:26:00,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:26:00,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:26:00,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:26:00,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:26:00,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2025-01-10 00:26:00,620 INFO L87 Difference]: Start difference. First operand 1503 states and 1752 transitions. Second operand has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 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-01-10 00:26:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:26:05,427 INFO L93 Difference]: Finished difference Result 1505 states and 1759 transitions. [2025-01-10 00:26:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:26:05,428 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 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 91 [2025-01-10 00:26:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:26:05,433 INFO L225 Difference]: With dead ends: 1505 [2025-01-10 00:26:05,433 INFO L226 Difference]: Without dead ends: 1505 [2025-01-10 00:26:05,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2025-01-10 00:26:05,434 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1528 mSDsluCounter, 10377 mSDsCounter, 0 mSdLazyCounter, 9497 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 11418 SdHoareTripleChecker+Invalid, 9527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 9497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:26:05,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 11418 Invalid, 9527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 9497 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-10 00:26:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-01-10 00:26:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1490. [2025-01-10 00:26:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1017 states have (on average 1.6853490658800394) internal successors, (1714), 1479 states have internal predecessors, (1714), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:26:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1738 transitions. [2025-01-10 00:26:05,457 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1738 transitions. Word has length 91 [2025-01-10 00:26:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:26:05,457 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1738 transitions. [2025-01-10 00:26:05,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 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-01-10 00:26:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1738 transitions. [2025-01-10 00:26:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:26:05,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:26:05,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:26:05,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:26:05,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 00:26:05,660 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:26:05,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:26:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash -83601666, now seen corresponding path program 1 times [2025-01-10 00:26:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:26:05,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17480367] [2025-01-10 00:26:05,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:26:05,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:26:05,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:26:05,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:05,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:26:06,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:26:06,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17480367] [2025-01-10 00:26:06,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17480367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:26:06,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:26:06,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-10 00:26:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167300536] [2025-01-10 00:26:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:26:06,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:26:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:26:06,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:26:06,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:26:06,080 INFO L87 Difference]: Start difference. First operand 1490 states and 1738 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 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-01-10 00:26:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:26:08,916 INFO L93 Difference]: Finished difference Result 1509 states and 1763 transitions. [2025-01-10 00:26:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:26:08,917 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 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 93 [2025-01-10 00:26:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:26:08,919 INFO L225 Difference]: With dead ends: 1509 [2025-01-10 00:26:08,919 INFO L226 Difference]: Without dead ends: 1509 [2025-01-10 00:26:08,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-01-10 00:26:08,920 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 1563 mSDsluCounter, 8104 mSDsCounter, 0 mSdLazyCounter, 5415 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 9139 SdHoareTripleChecker+Invalid, 5441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:26:08,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 9139 Invalid, 5441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5415 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:26:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-01-10 00:26:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1505. [2025-01-10 00:26:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1031 states have (on average 1.6779825412221145) internal successors, (1730), 1493 states have internal predecessors, (1730), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:26:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1755 transitions. [2025-01-10 00:26:08,930 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1755 transitions. Word has length 93 [2025-01-10 00:26:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:26:08,930 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1755 transitions. [2025-01-10 00:26:08,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 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-01-10 00:26:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1755 transitions. [2025-01-10 00:26:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:26:08,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:26:08,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:26:08,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 00:26:08,931 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:26:08,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:26:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash -83601665, now seen corresponding path program 1 times [2025-01-10 00:26:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:26:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003691144] [2025-01-10 00:26:08,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:26:08,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:26:08,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:26:08,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:08,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:26:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:26:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003691144] [2025-01-10 00:26:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003691144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:26:09,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:26:09,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:26:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918121420] [2025-01-10 00:26:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:26:09,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:26:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:26:09,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:26:09,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:26:09,435 INFO L87 Difference]: Start difference. First operand 1505 states and 1755 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-01-10 00:26:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:26:12,450 INFO L93 Difference]: Finished difference Result 1508 states and 1762 transitions. [2025-01-10 00:26:12,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:26:12,450 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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 93 [2025-01-10 00:26:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:26:12,452 INFO L225 Difference]: With dead ends: 1508 [2025-01-10 00:26:12,452 INFO L226 Difference]: Without dead ends: 1508 [2025-01-10 00:26:12,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:26:12,453 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1556 mSDsluCounter, 5211 mSDsCounter, 0 mSdLazyCounter, 5053 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 6253 SdHoareTripleChecker+Invalid, 5077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:26:12,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 6253 Invalid, 5077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5053 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-10 00:26:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-01-10 00:26:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1505. [2025-01-10 00:26:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1031 states have (on average 1.6770126091173618) internal successors, (1729), 1493 states have internal predecessors, (1729), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:26:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1754 transitions. [2025-01-10 00:26:12,467 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1754 transitions. Word has length 93 [2025-01-10 00:26:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:26:12,467 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1754 transitions. [2025-01-10 00:26:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-01-10 00:26:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1754 transitions. [2025-01-10 00:26:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:26:12,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:26:12,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:26:12,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 00:26:12,468 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:26:12,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:26:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1481971086, now seen corresponding path program 1 times [2025-01-10 00:26:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:26:12,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582007737] [2025-01-10 00:26:12,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:26:12,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:26:12,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:26:12,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:12,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:26:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:26:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582007737] [2025-01-10 00:26:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582007737] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:26:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905363224] [2025-01-10 00:26:12,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:12,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:26:12,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:26:12,884 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:26:12,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:26:13,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:26:13,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:26:13,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:13,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:13,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 00:26:13,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:26:13,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:26:13,176 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:26:13,176 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-01-10 00:26:13,180 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 19 treesize of output 1 [2025-01-10 00:26:13,246 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:13,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:26:13,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:13,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:26:13,339 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:13,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:26:13,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:13,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:26:13,387 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 13 [2025-01-10 00:26:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:26:13,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:26:13,397 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:26:13,430 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1829))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:26:17,588 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-01-10 00:26:17,588 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 105 treesize of output 104 [2025-01-10 00:26:17,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1828 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1833))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1828)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1829)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-01-10 00:26:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905363224] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:26:17,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:26:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-01-10 00:26:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983884008] [2025-01-10 00:26:17,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:26:17,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 00:26:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:26:17,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 00:26:17,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=473, Unknown=43, NotChecked=144, Total=756 [2025-01-10 00:26:17,595 INFO L87 Difference]: Start difference. First operand 1505 states and 1754 transitions. Second operand has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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-01-10 00:26:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:26:20,629 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2025-01-10 00:26:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:26:20,632 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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 94 [2025-01-10 00:26:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:26:20,635 INFO L225 Difference]: With dead ends: 1507 [2025-01-10 00:26:20,639 INFO L226 Difference]: Without dead ends: 1507 [2025-01-10 00:26:20,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=185, Invalid=898, Unknown=51, NotChecked=198, Total=1332 [2025-01-10 00:26:20,640 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 1527 mSDsluCounter, 10102 mSDsCounter, 0 mSdLazyCounter, 6574 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 11137 SdHoareTripleChecker+Invalid, 6611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 6574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:26:20,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 11137 Invalid, 6611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 6574 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-10 00:26:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-01-10 00:26:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1504. [2025-01-10 00:26:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1031 states have (on average 1.6760426770126091) internal successors, (1728), 1492 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:26:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1753 transitions. [2025-01-10 00:26:20,660 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1753 transitions. Word has length 94 [2025-01-10 00:26:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:26:20,661 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1753 transitions. [2025-01-10 00:26:20,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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-01-10 00:26:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1753 transitions. [2025-01-10 00:26:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:26:20,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:26:20,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:26:20,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:26:20,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:26:20,866 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:26:20,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:26:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1481971085, now seen corresponding path program 1 times [2025-01-10 00:26:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:26:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617200834] [2025-01-10 00:26:20,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:26:20,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:26:20,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:26:20,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:20,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:26:21,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:26:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617200834] [2025-01-10 00:26:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617200834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:26:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907091562] [2025-01-10 00:26:21,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:21,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:26:21,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:26:21,490 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:26:21,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:26:21,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:26:21,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:26:21,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:21,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:21,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-10 00:26:21,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:26:21,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:26:21,813 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:26:21,814 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-01-10 00:26:21,820 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 8 treesize of output 1 [2025-01-10 00:26:21,844 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 19 treesize of output 1 [2025-01-10 00:26:21,850 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-01-10 00:26:21,926 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 22 treesize of output 10 [2025-01-10 00:26:21,930 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 9 treesize of output 3 [2025-01-10 00:26:22,018 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:22,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:26:22,022 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 30 treesize of output 13 [2025-01-10 00:26:22,097 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:22,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:26:22,103 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 30 treesize of output 13 [2025-01-10 00:26:22,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:22,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:26:22,160 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 30 treesize of output 13 [2025-01-10 00:26:22,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:22,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:26:22,218 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 30 treesize of output 13 [2025-01-10 00:26:22,233 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 13 [2025-01-10 00:26:22,238 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 9 treesize of output 3 [2025-01-10 00:26:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:26:22,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:26:22,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2003 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-01-10 00:26:22,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2003 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2025-01-10 00:26:22,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2000) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2001))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2000) .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:26:22,363 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2000) .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2000) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2025-01-10 00:26:22,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1998))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1999) .cse0 v_ArrVal_2000) .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1998))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1999) .cse5 v_ArrVal_2000) (select (select (store .cse6 .cse5 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2003))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-01-10 00:26:22,722 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2008 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2009))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1998))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2001))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2008) .cse0 v_ArrVal_1999) .cse1 v_ArrVal_2000) .cse2 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2008 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2009))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1998))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2008) .cse7 v_ArrVal_1999) .cse8 v_ArrVal_2000) (select (select (store .cse9 .cse8 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2003))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-01-10 00:26:22,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907091562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:26:22,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:26:22,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-01-10 00:26:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582153730] [2025-01-10 00:26:22,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:26:22,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:26:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:26:22,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:26:22,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=594, Unknown=21, NotChecked=330, Total=1056 [2025-01-10 00:26:22,727 INFO L87 Difference]: Start difference. First operand 1504 states and 1753 transitions. Second operand has 24 states, 21 states have (on average 7.190476190476191) internal successors, (151), 24 states have internal predecessors, (151), 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-01-10 00:26:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:26:29,233 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2025-01-10 00:26:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:26:29,234 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.190476190476191) internal successors, (151), 24 states have internal predecessors, (151), 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 94 [2025-01-10 00:26:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:26:29,236 INFO L225 Difference]: With dead ends: 1506 [2025-01-10 00:26:29,236 INFO L226 Difference]: Without dead ends: 1506 [2025-01-10 00:26:29,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=945, Unknown=21, NotChecked=414, Total=1560 [2025-01-10 00:26:29,237 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 1524 mSDsluCounter, 10192 mSDsCounter, 0 mSdLazyCounter, 9738 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 11232 SdHoareTripleChecker+Invalid, 9767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 9738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:26:29,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 11232 Invalid, 9767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 9738 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-01-10 00:26:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-10 00:26:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1488. [2025-01-10 00:26:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1017 states have (on average 1.6833824975417895) internal successors, (1712), 1477 states have internal predecessors, (1712), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:26:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1736 transitions. [2025-01-10 00:26:29,250 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1736 transitions. Word has length 94 [2025-01-10 00:26:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:26:29,250 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1736 transitions. [2025-01-10 00:26:29,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.190476190476191) internal successors, (151), 24 states have internal predecessors, (151), 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-01-10 00:26:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1736 transitions. [2025-01-10 00:26:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 00:26:29,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:26:29,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:26:29,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:26:29,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 00:26:29,452 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:26:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:26:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1542308672, now seen corresponding path program 1 times [2025-01-10 00:26:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:26:29,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549074867] [2025-01-10 00:26:29,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:26:29,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 00:26:29,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 00:26:29,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:29,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:26:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:26:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549074867] [2025-01-10 00:26:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549074867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:26:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:26:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-10 00:26:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885358942] [2025-01-10 00:26:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:26:29,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:26:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:26:29,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:26:29,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:26:29,987 INFO L87 Difference]: Start difference. First operand 1488 states and 1736 transitions. Second operand has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 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-01-10 00:26:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:26:33,142 INFO L93 Difference]: Finished difference Result 1511 states and 1765 transitions. [2025-01-10 00:26:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:26:33,143 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 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 97 [2025-01-10 00:26:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:26:33,145 INFO L225 Difference]: With dead ends: 1511 [2025-01-10 00:26:33,145 INFO L226 Difference]: Without dead ends: 1511 [2025-01-10 00:26:33,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-01-10 00:26:33,146 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 1558 mSDsluCounter, 9086 mSDsCounter, 0 mSdLazyCounter, 6002 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 10120 SdHoareTripleChecker+Invalid, 6029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 6002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:26:33,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 10120 Invalid, 6029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 6002 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-10 00:26:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-01-10 00:26:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1507. [2025-01-10 00:26:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1035 states have (on average 1.6734299516908213) internal successors, (1732), 1495 states have internal predecessors, (1732), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:26:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1757 transitions. [2025-01-10 00:26:33,158 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1757 transitions. Word has length 97 [2025-01-10 00:26:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:26:33,158 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1757 transitions. [2025-01-10 00:26:33,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 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-01-10 00:26:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1757 transitions. [2025-01-10 00:26:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 00:26:33,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:26:33,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:26:33,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 00:26:33,159 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:26:33,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:26:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1542308671, now seen corresponding path program 1 times [2025-01-10 00:26:33,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:26:33,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607443317] [2025-01-10 00:26:33,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:33,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:26:33,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 00:26:33,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 00:26:33,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:33,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:26:33,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:26:33,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607443317] [2025-01-10 00:26:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607443317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:26:33,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:26:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-10 00:26:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983181534] [2025-01-10 00:26:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:26:33,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:26:33,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:26:33,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:26:33,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:26:33,989 INFO L87 Difference]: Start difference. First operand 1507 states and 1757 transitions. Second operand has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 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)